Programming Interview: Longest Common Subsequence Dynamic Programming
This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA.
Given two strings X[m] and Y[n], find the longest common subsequence of the two given strings.
Given two sequences, find the length of longest subsequence present in both of them.
A sub sequence is a sequence that appears in the same relative order, but not necessarily contiguous.
example
X= T A B A E D A Y= C A N B H A E U Y A
LCS = { ABAEA }
You can find the code for longest common subsequence at
http://codepad.org/HcFo97Jo
Code posted by Gerald Stan : http://ideone.com/xyuQgw
This channel is an ultimate guide to prepare for job interviews for software engineers, software test engineers, computer scientists, engineering students specially computer science and IT engineers, MCA and BCA students. The content of this channel will help students prepare for C,C++, Java, data structures and algorithms. It also covers courses related to networking and database. This channel can be used by students of NIIT, IGNOU etc too.
To study interview questions on Linked List watch • Programming Interviews: Linked List
To prepare for programming Interview Questions on Binary Trees
• Programming Interviews: Binary Trees
To study programming Interview questions on Stack, Queues, Arrays visit
• Programming Interviews: Queue, Stack and A...
To watch all Programming Interview Questions visit
• Programming Interviews Questions
To learn about Pointers in C visit
• Pointers in C (All you wanted to know)
To learn C programming from IITian S.Saurabh visit
• C Programming Tutorial
"longest common subsequence" "longest common subsequence dynamic programming" Refer to "longest common subsequence geeksforgeeks"
"dynamic programming longest common subsequence wiki"
"dynamic programming longest common subsequence"