Domino Tiling

CodeChefOpen on judge ↗

You have a $1 X N$ checker board, an infinite supply of $1 X 1$ dominos available in 3 different colours - red, green & blue, an infinite supply of $1 X 2$ dominos available in 2 different colours - black and white. You have to figure out the number of distinct ways in which you can tile the checker board using dominos. $Hint:$ The number of ways to tile $T_n$ can be modelled by the recur

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI