### 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/8f/f9/8ff97fd94110276d48ddea69e065f76b9bc1cd51c/2b/8c2b8b415cab72901fa59f166f5c0fb14de71464.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/8
~~~~~↵
↵