freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-161-triominoes.english.md

id	challengeType	title	forumTopicId
5900f40d1000cf542c50ff20	5	Problem 161: Triominoes	301795

Description

A triomino is a shape consisting of three squares joined via the edges. There are two basic forms:

If all possible orientations are taken into account there are six:

Any n by m grid for which nxm is divisible by 3 can be tiled with triominoes. If we consider tilings that can be obtained by reflection or rotation from another tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes:

In how many ways can a 9 by 12 grid be tiled in this way by triominoes?

Instructions

Tests

tests:
  - text: <code>euler161()</code> should return 20574308184277972.
    testString: assert.strictEqual(euler161(), 20574308184277972);

Challenge Seed

function euler161() {
  // Good luck!
  return true;
}

euler161();

Solution

// solution required