sir I’m not able to figure out that what could be the base case for the tilling problem.
Tilling problem
why its showing that doubt is resolved
Floor - n x m
Tiles - m x 1
If n < m, there is only one way. But if n = m, there are two ways to place the tiles.
These two will be the base cases.