ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

9 results

CodeLucky
KMP Algorithm Explained: Linear Time String Matching Made Simple

Master the Knuth-Morris-Pratt (KMP) algorithm in this visual, beginner-friendly guide! String matching is a fundamental problem ...

3:41
KMP Algorithm Explained: Linear Time String Matching Made Simple

0 views

6 days ago

CodeLucky
Longest Common Subsequence (LCS) - Dynamic Programming & String Matching Explained

Learn how to solve the Longest Common Subsequence (LCS) problem using Dynamic Programming! In this video, we break ...

5:04
Longest Common Subsequence (LCS) - Dynamic Programming & String Matching Explained

1 view

3 days ago

My Notes with ai
DSA  Foundations of Code

topics Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer–Moore algorithm, the Knuth-Morris-Pratt ...

6:46
DSA Foundations of Code

0 views

3 days ago

Let's LeetCode
LeetCode #28 "Find the Needle in a Haystack" (strStr) — AI-Assisted Mastery for Coding Interviews

No rushed tricks. No confusing jargon. Just clear intuition and human-verified code for LeetCode's essential string-matching ...

7:28
LeetCode #28 "Find the Needle in a Haystack" (strStr) — AI-Assisted Mastery for Coding Interviews

0 views

5 days ago

CodeLucky
Implement strStr() - Find Needle in Haystack - LeetCode Solution

Learn how to implement the strStr() function, a classic coding interview problem that asks you to find the index of a substring ...

4:13
Implement strStr() - Find Needle in Haystack - LeetCode Solution

14 views

6 days ago

CodeLucky
Palindrome Pairs Solution - LeetCode Hard Explained Efficiently

Learn how to solve the Palindrome Pairs coding interview problem efficiently! In this video, we break down the "Palindrome ...

3:35
Palindrome Pairs Solution - LeetCode Hard Explained Efficiently

0 views

3 days ago

CodeLucky
Count Different Palindromic Subsequences - LeetCode Hard DP Explained

Learn how to solve the 'Count Different Palindromic Subsequences' problem using Dynamic Programming! This video breaks ...

3:27
Count Different Palindromic Subsequences - LeetCode Hard DP Explained

0 views

3 days ago

Tejas Kumar
Passkeys, Passwords, and Identity: An Authentication Deep Dive

Links - Codecrafters (sponsor): https://tej.as/codecrafters - Clerk: https://clerk.com - Auth0: https://auth0.com - Arctic (OAuth ...

1:36:39
Passkeys, Passwords, and Identity: An Authentication Deep Dive

151 views

3 days ago

CodeLucky
Maximum Length of Repeated Subarray - Dynamic Programming (LeetCode 718)

Learn how to solve the Maximum Length of Repeated Subarray problem (also known as Longest Common Substring) using ...

3:46
Maximum Length of Repeated Subarray - Dynamic Programming (LeetCode 718)

0 views

3 days ago