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

Finding the longest common subsequence of two strings is a well known dynamic programming problem. I'm talking about two different solutions: recursive dp with memoization and iterative dp.

Subscribe for more educational videos on algorithms, coding interviews and competitive programming.

#Coding #Programming

[Errichto]

Educative giveaway winners were contacted via email on May 2.

[shubhamtomar]

I like how talented, confident and yet humble errichto is! :)

[kaueluisoliveiradasilva]

Best channel about coding! Please keep posting.

[bethsuni]

6:24 this is King Crimson's ability.
Errichto confirmed stand user.

[phillip]

I hope you keep growing in your youtube career world and in your competitive coding career. Awesome you share your experience and problem solving skills with us.

[ClaudioBrogliato]

Damn, I started with the recursive approach but when I hit the time constraint I wasn't sure caching would be enough to pass and so I changed my mind and went iterative.

[arkalykakash]

Great explanation. Thank you Errichto!

[nowarm]

thank you so much Errichto for sharing your knowledge. I really enjoy thinking and learning with your explanation. It makes so much sense.

[nisharege]

So what is better iterative or recursive? Best explanation!!!

[hamzaxvz]

please keep posting videos like this, all the best..

[raahelbaig]

I looked up the algorithm on Back to Back SWE. I couldn't solve it on my own. This question was my first cheat in the challenge.

[flamendless]

Awesome! Please explain the iterative solution with drawings.

[parthokunda]

Awesome video. Really loved your explanation.

[vishalvatsalya]

Can you please do the Hack the Interview 2 problem explaination for the last questions? 😅

[amanrubey]

My wish is to watch Errichto solve questions daily

[Expanses]

My recursive solution got TLE and iterative solution got accepted. Is there a significant difference in there execution time, since the complexity is same too ?

[rajsahu]

please discuss the problem of minimum string coefficient of hackerrank hack the interview 2

[lovvyparhar]

Instead of writing find and all we can use map.count(key) to know if the element is present in the map or not. I find it very useful.

[shubhamtomar]

VIDEO/SERIES REQUEST : solutions and explanations for problems in CodeJam Archives.

[mohammedshoaib]

Petition for Errichto to pop his fingers for intro 🙌