Algorithm · JPMorgan · Medium
Requirements Explain the number of domino tilings for a board measuring 2 x N, using dominoes with dimensions 1 x 2 or 2 x 1. Develop the recurrence from the possible arrangements at the board's edge instead of merely naming the resulting sequence. Follow-up: explain how the problem changes for a 3 x N board covered by the same dominoes. Notes Be prepared to justify your reasoning about the board's first section and the remaining subproblem. The wider 3 x N version requires…
Checking your access…