##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Section overview
Trees and graphs make up about % of Meta coding questions. I'll cover more problems here: tree traversals, graph cloning, connected components, selection algorithms, weighted random sampling, cache design, and expression parsing.
These problems are harder than Section and typically appear as problem in a coding round or in senior-level interviews.
