Coding Interview Question | Longest Common Subsequence | Dynamic Programming with space optimization

Опубликовано: 16 Апрель 2020
на канале: Keerti Purswani

6,536

206

LeetCode Link - https://leetcode.com/problems/longest...
InterviewBit Link - https://www.interviewbit.com/problems...
Hackerrank Link - https://www.hackerrank.com/challenges...

Please subscribe to my channel - / keertipurswani

Video includes following details-
0:00-1:45- Question explanation
1:45-2:50- Brute Force approach with efficiency
2:50-6:20- Concept of solution
6:20-9:03- Recursive approach and memoization
9:03-14:10- Dynamic Programming approach
14:10-16:25- Final algorithm
16:25-19:55- Dry run of algorithm
19:55-20:50- Efficiency of dp solution
20:50-22:25- Space optimization of dp
22:25-26:15- Dry run of space optimized solution

At 1:27 - I have mentioned CED is common subsequence for the two strings. That is wrong. Please ignore this example.

LinkedIn - / keertipurswani
Instagram - https://www.instagram.com/keerti.purs...