Arrays are the most common data structure. Many array problems have greedy solutions that are simpler and faster than DP. In this section, I will show you how to apply greedy thinking to array problems: jump games, gas stations, boats, and more.
The key is finding the right greedy choice at each step.
Without greedy insights, you would default to exponential search or quadratic DP solutions.