### 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? ↵
↵
↵
~~~~~↵
![ ](/predownloaded/ce/d3/ced373a5bcc0ad1cb24758a53bfffbc1826cbdc4.png)↵
~~~~~↵
↵
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?
↵
↵
~~~~~↵
![ ](/predownloaded/ce/d3/ced373a5bcc0ad1cb24758a53bfffbc1826cbdc4.png)↵
~~~~~↵
↵