ViewTube

Learn how to solve the Minimum Path Sum problem using Dynamic Programming! In this video, we break down the classic grid ...

Learn how to solve the Wildcard Pattern Matching problem (often LeetCode 44) using Dynamic Programming! In this video, we ...

Learn how to solve the 'Minimum Cost to Merge Stones' problem using Interval Dynamic Programming! This video breaks ...

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

Many people breeze through the first two questions in a contest only to hit a wall on Q3 and Q4. The issue usually isn't a lack of ...

Learn how to solve the Minimum Cost For Tickets problem (LeetCode 983) using Dynamic Programming! In this video, we ...

Learn how to solve the House Robber problem (LeetCode 198) using Dynamic Programming! In this video, we break down ...

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

Learn how to solve the 'Number of Longest Increasing Subsequence' problem using Dynamic Programming! In this video, we ...

Learn how to solve the 'Delete And Earn' problem (LeetCode 740) using Dynamic Programming! In this video, we break down ...

Topics covered: 2D Matrix Traversal Dynamic Programming (Histogram construction) Largest Rectangle in Histogram ...

Learn how to solve the 'Minimum ASCII Delete Sum' coding interview problem using Dynamic Programming! In this video, we ...

Learn how to solve the Min Cost Climbing Stairs problem (LeetCode 746) using Dynamic Programming! In this video, we break ...

Learn how to solve the Interleaving String problem (LeetCode 97) using Dynamic Programming! In this video, we break down ...

Learn how to solve the classic "Unique Paths" coding interview problem using Dynamic Programming! In this video, we break ...

Master the famous Egg Drop Problem often asked in Google and Amazon coding interviews! In this video, we break down the ...

Topics covered: - Understanding Regex Wildcards (. and *) - Recursive Logic & Edge Cases - Dynamic Programming Table ...

Learn how to solve the Perfect Squares problem (LeetCode 279) effectively! In this video, we explore why the Greedy approach ...

Learn how to solve the Edit Distance (Levenshtein Distance) problem using Dynamic Programming! In this video, we break ...

Learn how to solve the Maximal Square problem (LeetCode 221) using Dynamic Programming! In this video, we break down ...