Greedy
Taking the best choice at each step when that is provably enough.
| Status | Challenge | Topics | Level | Accepted | Save |
|---|---|---|---|---|---|
| 1.Best Time to TradePick one day to buy and a later day to sell for the biggest profit. | ArraysGreedy | Easy | – | ||
| 2.Maximum SubarrayFind the largest sum of a run of consecutive numbers. | ArraysDynamic programmingGreedy | Medium | – | ||
| 3.Container With Most WaterPick two walls that hold the most water between them. | ArraysTwo pointersGreedy | Medium | – | ||
| 4.Jump GameDecide whether you can jump from the first square to the last. | ArraysGreedyDynamic programming | Medium | – |