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

Published: 16 April 2020
on channel: 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...

Watch video Coding Interview Question | Longest Common Subsequence | Dynamic Programming with space optimization online, duration hours minute second in high quality that is uploaded to the channel Keerti Purswani 16 April 2020. Share the link to the video on social media so that your subscribers and friends will also watch this video. This video clip has been viewed 6,536 times and liked it 206 visitors.

2,870

241