Longest Common Subsequence | Part 1 | Dynamic Programming | Interview Question(LeetCode #1143)

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

In this video I have covered the method of solving the Longest Common Subsequence Problem using Dynamic Programming. This is the first part of the video on LCS. In the second part I will cover the code for optimizing the space complexity further. Do go through the video and try the question yourself before looking at the coding part.

→ Topic - Dynamic Programming
→ Space complexity - O(n*m)
→ Time complexity - O(n*m)

__________________________________________________________________________

SUBSECTIONS
Intro : (0:00)
Question Overview (Reading the question) : (0:03)
In-depth Analysis (Dry running example problem) : (3:41)
Code it (Coding Solution) : (14:52)
Space-Time Complexity ( Isn’t it obvious?) : (17:56)

_________________________________________________________________________

Follow me on social media:

________________________________________________________________________

Also comment below questions you want me to cover next or any other suggestions or doubts are welcome?

#leetcode #C++ #programming #coding #interviewquestions #SuyashiSinghal #LCS #LongestCommonSubsequence #dynamicprogramming #dsa #dp

Рекомендации по теме

Комментарии

Nice and clear DP walkthrough of LCS algorithm.
Many thanks!!

CostaKazistov

Very well explained!! Thanks for making this amazing video👏

AnshulYadav-osmw

Please upload more videos, your way of teaching is very awesome. Thanks

Polly

hi can you make a video on regular expression matching and it will be great if u can start with the recursive approach and then move to tabulation one. thanks

ritwik

Please don't jump directly to 2D matrix. Explain the intuition first. I hope this helps!

LearnCodeHS

Longest Common Subsequence | Part 1 | Dynamic Programming | Interview Question(LeetCode #1143)

Longest Common Subsequence - Dynamic Programming - Leetcode 1143

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

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

Longest Common Subsequence

Longest common subsequence algorithm -- example

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

Dynamic Programming | Set 4 (Longest Common Subsequence) | GeeksforGeeks

Longest Common Subsequence Problem - Dynamic Programming Algorithms in Python (Part 7)

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

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

Longest Common Subsequence - Leetcode 1143 - Dynamic Programming (Python)

Longest Common Subsequence (LeetCode 1143) | Full Solution with a natural explanation

Longest Common Subsequence | Dynamic Programming

Short trick to solve longest common subsequence(LCS)

Longest Common Subsequence - Dynamic Programming

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

Leetcode - Longest Common Subsequence (Python)

What is the longest common subsequence problem? #shorts #compsci #datastructures #leetcode

Leetcode 1143. Longest Common Subsequence #shorts #python #coding

[Algorithms] What is the longest common subsequence problem?

[Algorithms] Optimal-substructure property of the longest common subsequence problem

Dynamic Programming | Longest Common Subsequence (LCS) | Part 1

The Alignment Game and the Longest Common Subsequence Problem

[Algorithms] Dynamic programming for solving the longest common subsequence problem