Please tell me the approach how to solve this problem
@vivekpatel,
Thus f(n) = number of ways to fill length n = f(n-1) + f(n-m).
