Longest Common Substring | Recursion + Memoisation + Tabulation | DP-28

preview_player
Показать описание

Welcome to my brand new Dynamic Programming playlist! 🎉 In this series, we'll dive deep into the world of dynamic programming and explore various problem-solving techniques.

📚 GitHub Repository:

👍 Don't forget to like, share, and subscribe to our channel for more exciting
content on algorithms, data structures, and problem-solving! 🔔

And yes, the outro music is produced by me🎶😄

🔗Connect with me:

Problem Statement 0:00
Recursion Approach 05:23
Recursion Summary 29:26
Recursion Code 33:39
Memoisation Code 37:36
Tabulation Approach 41:30
Tabulation Code 47:49
  1. Rohanfizz
  2. Coding
  3. Programming
  4. CodingInterview
  5. CodingProblems
  6. SoftwareEngineering
Рекомендации по теме
Longest Common Substring 0:24:21

Longest Common Substring | Recursion and Memoization

Longest Common Substring 0:51:14

Longest Common Substring | Recursion + Memoisation + Tabulation | DP-28

DP 27. Longest 0:14:01

DP 27. Longest Common Substring | DP on Strings 🔥

Longest common substring 0:20:47

Longest common substring | Dynamic programming

DP - 7: 0:20:52

DP - 7: Longest common Substring

Longest Common Substring 0:21:56

Longest Common Substring | Dynamic Programming | Intuition and explanation w/ animations

Longest Common Substring 0:05:31

Longest Common Substring

Longest Common Subsequence 0:18:25

Longest Common Subsequence - Dynamic Programming - Leetcode 1143

22 Longest Common 0:13:00

22 Longest Common Substring

4.9 Longest Common 0:23:35

4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

Longest Common Substring 0:33:08

Longest Common Substring PART 1 | Memoization | Java | Recursion, Dynamic Programming

Longest Common Subsequence 0:19:44

Longest Common Subsequence - Recursive and Iterative DP (LeetCode Day 26)

Most Asked FAANG 0:00:40

Most Asked FAANG Coding Question! | Longest Common Prefix - Leetcode 14

16. Dynamic Programming, 0:58:44

16. Dynamic Programming, Part 2: LCS, LIS, Coins

Longest Common Substring 0:27:22

Longest Common Substring Dynamic Programming

1143. Longest Common 0:24:41

1143. Longest Common Subsequence | Recursion - Greedy - Memo - Bottom Up - Bottom Up Optimised

06 - Longest 0:06:37

06 - Longest Common Subsequence - Recursive approach

[Algorithms] Recursive solution 0:03:54

[Algorithms] Recursive solution for the longest common subsequence problem

Longest Common Substring 0:35:28

Longest Common Substring PART 2 | Bottom Up DP | Java | Recursion, Dynamic Programming

Longest Common Subsequence 0:37:00

Longest Common Subsequence | Recursion + Memoisation + Tabulation | DP-27

Amazon Coding Interview 0:27:07

Amazon Coding Interview | Longest Common Substring Dynamic programming | EP6

Dp 25. Longest 0:47:09

Dp 25. Longest Common Subsequence | Top Down | Bottom-Up | Space Optimised | DP on Strings

Sliding Window Algorithm 0:00:59

Sliding Window Algorithm Explained Clearly | Longest Substring Without Repeating Characters Leetcode

Longest Common Subsequence 0:25:31

Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems

Комментарии
Автор

Hey thnxs mate!
I was just looking and no one was going for recursive solution for this problem, but thnxs to you, now my concepts for this problem are crystal clear.
Hope your channel grows well.

darkistheknight
Автор

best ...i was searching the whole youtube for recursion for this particular problem

NikhilChoudhary-hifo
Автор

bro
I just subscribed to you
even to I am a very good coder expert on codeforces, I had trouble in understanding this problem ( mainly the recursion diference between this and LCS)
you explain it so clearly by far compared to anyone on youtube

akashparit
Автор

Amazing lecture, slowly becoming my go to playlist for DP.

CodingJoySoul
Автор

for this problem recursion is slightly tough but tabulation is very very easy

vishalagarwal
Автор

Amazing lecture sir.

Explanation is easy understand.. thank you so much sir ..😍😍😍😍

rajeevkumar-weky
Автор

I have one doubt that why we are comparing cnt (v1 v2, v3, cnt)

chiragasawa