70. Climbing Stairs
This is a classic dynamic programming problem.
LeetCode
11. Container With Most Water
通过观察面积公式，如果我们想让面积最大，就要让(right_index - left_index)由最大值向0收敛，并且尽可能地提高Min(height[left_index], height[right_index])的“短板”。
146. LRU Cache
Design a LRU cache
5. Longest Palindromic Substring
We can solve this problem in many ways.
361. Bomb Enemy
No summary
64. Minimum Path Sum
This is a classic dynamic programming problem.
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