Introduction
Plan to review the longest increasing subsequence algorithm again. It is getting much easy to work on the algorithm on Leetcode, the discussion of Leetcode 300 is Julia's favorite. Most of important job in the practice is to go over different ideas and seek the inspiration to solve the problem. It is the great to know one more idea, one more tip to solve the problem, and also go over different language.
There are over 70,000 accepted submissions, look at the statistics, Julia found out that it is a really home to the algorithm. Just dive in, get 30 - 60 minutes first round study. Do some research.
Algorithm problem solving
Julia's C# solution using dynamic programming is here.
Actionable Items
Work on Leetcode 516: longest palindromic subsequence
Julia's C# practice is here.
No comments:
Post a Comment