Greedy
Greedy algorithms iterate by always selecting the locally optimal choice at each step.
Greedy is always looking for a specific condition. its usually only one conditions it wants. you usually keep iterating finding that once condition.
Ex. Which event ends the earliest to maximize number of events attended Which largest coin denomination fits to cover a bill Which task is the shortest to get the most number of tasks done. What days have positive profit to maximize total value.
do again with dp study on 7-18