Dynamic programming · chapter 46
From O(n^2) to O(n log n) with patience piles.
DSA for coding interviews/Longest increasing subsequence
Loading the chapter...
sdev works best with JavaScript enabled. The courses live on YouTube.