Sorting and searching make up of Meta interviews. The must-know problems are Kth Largest (with QuickSelect), Merge Intervals (with the two-list variant), and Random Pick with Weight. Meta prefers QuickSelect over heaps for selection problems. Binary search works whenever you can eliminate half the search space with a comparison. For intervals, learn both the merge and intersection patterns. Always discuss time-space tradeoffs between different approaches.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/meta-interview-prep/sorting-searching/section-recap
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████