hritikkumar's blog

By hritikkumar, history, 11 months ago, In English

Problem:

Calculating the number of distinct ways to fill an n × m grid using 1 × 2 and 2 × 1 size tiles. For example, one valid solution for the 4 × 7 grid is and the total number of solutions is 781.

I want to solve this problem through Dynamic Programming. Please help me?

Read more »

 
 
 
 
  • Vote: I like it
  • -6
  • Vote: I do not like it