2.c) Domino and Tromino Tiling || Dynamic Programming
Вставка
- Опубліковано 25 сер 2024
- In this video on dynamic programming, I have discussed about tiling a floor using domino and trmino tiles.
The basic approach to solve such dynamic programming problems is to analyse the pattern for small inputs and then form the recurrence relation.
Practice questions:
1) Leetcode: leetcode.com/p...
Dynamic Programming playlist: • Dynamic Programming to...
Dynamic Programming repository: github.com/kas...
Graph playlist: • Topics in graph data s...
Playlist on binary search tree (bst) data structure: • 1) Binary Search tree ...
Playlist on binary tree data structure: • Trees Data Structure -...
Linkedin: / kashish-mehndiratta
I hope you liked my video, do subscribe to my channel to get the updates of my latest uploads.
#datastructure #algorithm #interviewquestions #placement #internship
awesome solution
great solution. I stopped looking at the number of ways after n=4 and thus couldn't see the pattern but now I get it. Thank you so much:) You got a subscriber!
Dp is all about maths Nice trick i -1 jisne dislike kiya h shayad usse samaj nahi aaya hoga 😅
excellent brother
underrated channel
thank you to make this video.
Perfect explanation , even better than Lee's explanation😌😌. Bhaiya also explain how to approach these type of problems in the interview.
Start from basic approach.
If you are unclear with any statement, do ask them.
Just keep discussing whatever you are thinking and keep progressing the question.
@@KashishMehndiratta Will keep in mind bhaiya . Thankyou ❤️❤️
good
Great explanation. And someone is eating behind him😂 and making video little annoying. Anyways nice teaching. Thanks
great explanation. just have one question, why dp[0] is 1 ?
because we can't place any tile hence there is only one way leave it
great video
sir aapke ghar walo nai pichle video mai jo hairstyle hai ussko mana kiya isliye aapne katwaya kya if i am not wrong??
😂😂😂👌