Leetcode 790. Domino and Tromino Tiling

[@imhimmazi7999]

Best description and explanation of the problem and recurrence relation on CZcams!

[@meicochief]

Bro, it is best explanation of this problem, thank you very much !

[@pif5023]

It took me a whole day to understand this damn problem! Thanks for the video!

[@piyushsrivastava5883]

relatable

[@RaghavNarula-c9f]

Very Good explanation. Keep up the good work 🙂

[@shadowmonarch1432]

That was a very good explanation 💥

[@alexanderp7521]

i can clearly see how one can spend the entire day on this issue without result...

[@samiulhaquesiddique4886]

You are the best

[@abbasahmad3006]

Best explanation i came across ❤

[@120183PAV]

By far best explanation to the problem

[@hhcdghjjgsdrt235]

You are DP god

[@TheEliteCoder]

Lately I’ve been feeling like a monotonic stack loser

[@mmatteii]

Thanks man. Clarified a lot .

[@ultimateanu]

Great explanation!

[@ashisranjandey7541]

Nice one

[@satanistbear4388]

Thank you! Amazing explanation

[@arinaymay]

Great solution

[@basvarajsb3857]

good one!

[@shatrudhankumar7824]

Awesome

[@grantwells16]

Why is F[0]=1 if it just represents a 2x0 (empty) space, I dont get why its not just 0

[@yeezusmcjesuz9405]

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

[@rthnrj]

Amazing