Backtracking / DP / Greedy

Problems of greedy algorithm are usually intuitively challenging. For this one, the high level concept is “while already able to jump…

A special diversion of “the longest ….”. To make it O(n), let the pointer move rather than nested for loop.

While the condition is as simple as the fib, this can be a good practice of dynamic programming.

Advanced version of Maximum Subarray. As multiplying a negative switches max/min, instead of keeping the localMax, both max & min should be…

Greedy algorithm: Builds up a solution piece by piece, always choose a local optimal solution (the way with the best result in current…

One of classic problems of combination/permutation. Combination means the sequence of elements in subset does not matter but which elments…

Do not think of what’s the answer for n. Instead, think of the answer for n - 1, n - 2, …, 1, and 0. We can always know the answer for 0…

Subsets problems are just like combinations.

A palindrome is same backward as forward. Also, a palindrome will still be palindrome after removing head and tail. Hence, this is a…