I also thought so initially, but on second thought you realise that n = 0 is an empty board, and by definition an empty board has nothing left to fill so it is already filled, there can't be 0 ways to fill an already filled board therefore F(0) = 1. Hope that makes sense
Best description and explanation of the problem and recurrence relation on CZcams!
Bro, it is best explanation of this problem, thank you very much !
It took me a whole day to understand this damn problem! Thanks for the video!
relatable
Very Good explanation. Keep up the good work 🙂
That was a very good explanation 💥
i can clearly see how one can spend the entire day on this issue without result...
You are the best
Best explanation i came across ❤
By far best explanation to the problem
You are DP god
Lately I’ve been feeling like a monotonic stack loser
Thanks man. Clarified a lot .
Great explanation!
Nice one
Thank you! Amazing explanation
Great solution
good one!
Awesome
Why is F[0]=1 if it just represents a 2x0 (empty) space, I dont get why its not just 0
I also thought so initially, but on second thought you realise that n = 0 is an empty board, and by definition an empty board has nothing left to fill so it is already filled, there can't be 0 ways to fill an already filled board therefore F(0) = 1. Hope that makes sense
Amazing