A Question That Should Not Be Asked In Interviews

Given a board that is n x n squares, where n is a power of 2, and that has one square removed from an arbitrary position, give an algorithm to completely cover the board with L shaped tiles made from three adjacent unit squares. An 8×8 board is shown in the figure; one removed square is shown in black; one L shaped green tile is placed on the board. Remember that the tiles can be placed in any orientation.



Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: