I came across this coding challenge and it sounds like a fun one!
You are given a
2 x Nboard, and instructed to completely cover the board with the following shapes:
- Dominoes, or
2 x 1rectangles.
- Trominoes, or
N = 4, here is one possible configuration.
Dis a domino, and
D T T O D T O O
Given an integer
N, determine in how many ways this task is possible.
I’ll update this post with my solution once I finish it but I want to see the ways other people solve the same problem. As programmers (or aspiring ones) it’s best that we keep learning; so why not learn together?
If you have questions while solving the problem reply to this post and we’ll work through it together