Can this be done without recursion?

How can we do this with dp

Hey @pranjalarora98
Yes you can apply BU DP

relation will be fibonacci
Assume u have n columns
So if u can place tile vertically then n-1 cols will be left otherwise if u place horizontally 2 tiles then n-2 col will be left