You have two types of tiles: a 2 x 1 domino shape and a tromino shape. You may rotate these shapes. Given an integer n, return the number of ways to tile an 2 x n board. Since the answer may be very ...
Given n, count the number of ways to tile a 2 x n board using 2 x 1 tiles. Approach / Explanation: 1) Let dp[n] be the number of ways to tile 2 x n. 2) dp[0]=1 and dp[1]=1 as base cases. 3) For n>=2, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results