Grokking Dynamic Programming Patterns for Coding Interviews
Vote

0% completed

​

Solution: Longest Increasing Subsequence

.....

.....

.....

Like the course? Get enrolled and start learning!
A

Anonymous

· 4 years ago

For bottom up, why keep track of max length instead of just returning dp[n-1]?

A

Anonymous

· 5 years ago

For top-down DP:

I can't seem to pass test case 24 using a dictionary in C# with this method on Leetcode. It works fine with a 2D matrix, however. Not sure why that is...

Reading Progress

0%

Vote for new content