64. Minimum Path Sum
This is a classic dynamic programming problem.
Dynamic Programming
322. Coin Change
This is a classic dynamic programming problem.
3. Longest Substring Without Repeating Characters
We can solve this problem with dynamic programming or sliding window.
300. Longest Increasing Subsequence
No summary
674. Longest Continuous Increasing Subsequence
No summary
63. Unique Paths II
The one difference between this problem and Unique Path is that we have to handle more of edge cases.
62. Unique Paths
This is a classic dynamic programming problem.