##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Grid tiling with dominoes. Process row by row, using a bitmask for the boundary between rows.
Covered with full walkthrough in this section.
Covered with full walkthrough in this section.
Covered with full walkthrough in this section.
Classic domino tiling with broken profile. Foundation for all plug DP problems.
Profile DP on bracket sequence. State encodes coloring of visible bracket pairs.
Bitmask DP on grid rows. Simpler broken profile before full plug DP complexity.
Bracket sequence with profile state. Counting valid configurations column by column.
Chess piece placement with broken profile. Tests understanding of diagonal state encoding.
Introduction to tiling DP. Simpler profile before full broken profile complexity.
Rectangle tiling with backtracking/DP. Tests profile state enumeration skills.
Two-path grid DP. Related state-space thinking to broken profile approaches.
Two robots grid DP. Column-by-column processing similar to profile DP paradigm.
