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 http://www.youtube.com/playlist?list=PL3D11462114F778D7&feature=view_all To prepare for programming Interview Questions on Binary Trees http://www.youtube.com/playlist?list=PLC3855D81E15BC990&feature=view_all To study programming Interview questions on Stack, Queues, Arrays visit http://www.youtube.com/playlist?list=PL65BCEDD6788C3F27&feature=view_all To watch all Programming Interview Questions visit http://www.youtube.com/playlist?list=PLD629C50E1A85BF84&feature=view_all To learn about Pointers in C visit http://www.youtube.com/playlist?list=PLC68607ACFA43C084&feature=view_all To learn C programming from IITian S.Saurabh visit http://www.youtube.com/playlist?list=PL3C47C530C457BACD&feature=view_all "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"