Domino and Tromino Tiling | Leetcode 790 | Live coding session 🔥🔥🔥🔥| Dynamic Programming Approach

Here is the solution to "Domino and Tromino Tiling" leetcode question. Hope you have a great time going through it.

1) 0:00 Explaining the problem out loud
2) 1:50 Algorithm walkthrough
3) 12:00 Coding

For discussion/feedback

PS : Please increase the speed to 1.25X

[praveenj]

it's very hard to come up with the solution at first glance for problems like this.

[TakeYourTimeBack]

Bro that solution in 12:00 it is what I was searching for, this math solution is perfect, nice job

[christrifinopoulos]

The step by step explanation was amazing. I would understand it even if I had no idea about algorithms and DP. good job!!!

[vinayakgupta]

For N= 4. The number of ways Tromino Tile + Domino Tile combinations can be 4, TD(upper empty space)T, TD(lower empty space)T, TTD, DDT, correct ?

[aditisrivastava]

Your explanations never disappoint. Thankyou

[pogo]

Wonderful explanation...
Your efforts are commendable

[KousthubhaKumar]

Great explanation, thank you! looking forward to more videos from this channel!

[nicolattu]

great explanation ! it was not easy to understand

[bloody]

This is a very very good question I'd say and I'll recommend everyone to pick up pen and paper to come to the conclusion behind the 2 that is being multiplied to every term starting f(n-3). There are a lot of concepts involved here. The crux is that you don't want to jump to the condition that is already being taken care of in the base cases (f(1), f(2) and f(3)).

[satanshuag]

how to grab above approach quickly :
1 ) watch full video understand it.
2) time take a book and dry run along with him.
3) Code yourself after understanding.

[jay-rathod-]

I pray to god these kinda questions don't pop in my interview. Btw how on earth do ya'll think soooo deeep mathematically. Isme DP kam math zyaada use hui hai.

[harshitsaluja]

We are removing duplicates when N=2 while calculating equations but for N-3 and N-4 we are not. Does not seems to be logical to me

[piyushsrivastava]

when n==4 then why can not we place one L then inverted L and then a vertical domino tile ?

[devesh_official_]

Sir you have multiplied by 2 after n-3 because for every case two possible ways are coming right??

[omnamahshivaya]

= dp[n-1], Can anybody please help me to understand it?

[StellasAdi]

Dear lord. Who asks such Q in SW interview 😢.

[shubhrajit]

Bro is seriously running short of page