##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
What this section covers
Amazon's harder coding rounds test dynamic programming and data structure design. This section has problems: from [[u:/roadmaps/pattern-22|Pattern ]] (Word Break) and worked out here.
LRU Cache and LFU Cache test whether you can combine multiple data structures for operations. The DP problems test whether you can define states, transitions, and optimize with binary search.
