Wednesday, February 14, 2018

Leetcode 300: Longest common subsequence

Feb. 14, 2018

Introduction


It is the medium level algorithm and can be solved using dynamic programming. This dynamic programming algorithm is getting easy since I have worked on the dynamic programming algorithm deletion distance over ten times last 11 months, and one of solution is to use longest common subsequence.

Algorithm study


I spent around 20 minutes to go over one blog and wrote down my study note. Here is the link.

No comments:

Post a Comment