##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Looking ahead
You have learned classic optimization problems:
Fractional knapsack: sort by ratio, take greedily.
Job sequencing: sort by profit, schedule in latest available slot.
Minimum platforms: count maximum overlap.
Task scheduler: formula based on max frequency. In the next section, I will show you advanced greedy: Huffman coding, reorganize string, and more.
