>Learn heapsort, quicksort, how to find medians, how to derandomize and calculate the running time of the quicksort/median algorithms. i've done around 800 lee

>Learn heapsort, quicksort, how to find medians, how to derandomize and calculate the running time of the quicksort/median algorithms. i've done around 800 leets and never had to learn any of these. you can do a whole bunch of leets if you just learn the following and fill the gaps along the way 1. data structures: tries, maps, lists, heaps/priorityques, stack, dequeue. 2. graph: shortest paths, dfs, bfs, cycle detection, topological sorting, union find. 3. binary search