##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
The trap
Keep a sorted list. On each addNum, insert in the right position. For findMedian, return the middle element(s).
Insertion into a sorted array takes to shift elements. With insertions, total is .
Can you add numbers faster while still finding the median quickly?
