- 3. Longest Substring Without Repeating Characters: Re-do
- 4. Median of Two Sorted Arrays: Optimize for time complexity
- 11. Container With Most Water: Re-do, better understand how the greedy choice optimizes the DP relation you came up with.
- 53. Maximum Subarray: I don't know why, but I never get why the solution works.
- 152. Maximum Product Subarray: SAME AS 53. I THINK WE PARTITION OUR SEARCH AROUND THE
0s. NOT SURE THO TBH. - 334. Increasing Triplet Subsequence: Improve notes.
- 916. Word Subsets: Will you remember the non-TLE trick next time? Can you speed it up some more? 200ms / 65% isn't top tier.