@@Pepcoding i wanted to ask that how will we thought this kind of logic ki last ballon 1 burst hoga or last ballon 2 burst hoga kyunki yhi pta nhi chal pata ki recursion ki approch kya honi chaiye bs
This is legendary explanation for such a difficult problem Sir. Not only did you explain the matter, but the intuition & the confusions one can face while understanding it ❤️
sir sawal thoda mushkil toh tha samajhna, par wohi baat hai jesa aap khete ho, dp ke block ka meaning samajh aa jaaye toh pura sawal simple ho jata hai, Thank u so much for the efforts that u give. Jitni baar aabki video dekhta hoon utni baar lagta hai ki i owe u so much for all this knowledge that i m gaining from u. Job lagti hi sir pehle aapse milne aana hai merko, baaki ke kaam hote rahenge, kyunki "EAST OR WEST SUMEET SIR IS THE BEST"
Sir i have been using your explanations for quite some time now and I really love these videos. These videos are so so helpful. Really respect the work that you have done ❤
Sir i am electronics student when I am in 3rd year then I am totally focused on gate but some time after I fell that we should have a practical knowledge but in gate everyone trying to get concepts not application of those Concept in pratical way and in India the number of psu is like a drop of water as compare to it industry companies and the work culture is like a Mangment type not application of knowledge for thease reasons I am totally confused that what should I do because coding is very tough some one tells me but when I found you then I realized that you are the best teacher of coding all teachers are good but you have a special thing which gives a lot of motivation your voice is like a postive waves which gives me a energy to succeed in his lif
we can use make only if g==0{} else{} rather than making 3 if else groups g>=2 code can be used for g==1 also after seeing sir's solution 😂: i thaught that sir is going to solve it by taking g==0,1,>1 as usual but sir is legend he is ine step ahead of me 😂😂🙌🏻
Sir meh ye video dekh raha hu or sb samjh bhii aa raha hai pr mujhe nahi laghta ki instantly meh aese logic laga paunga jb koi new question karunga toh sir kya dp ko relete kar ke hii karna padhta hai kya
Thank you. If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
I am glad you liked it. I also hope that you are watching till end. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
sir, one question ... why do we consider the elements before "i" and after "j" for calculating dp[i][j]. Why "not considering" them is a problem. If you don't get my question I can explain what I am talking about.
because we want to find the value of bursting balloons of i->j(substring) beginning before we bursting it's neighbor elements. as we can clearly see that we are going from last to first. so the neighbor elements(i-1,j+1) will stay there for the whole time while we bursting the elements inside this i->j range(i.e i,i+1,i+2,....,j-1,j elements). so everytime we pick a last burst balloon we have to mulitply it with remaining balloons that will be left and that should be outside of its range. I recommend you to solve this with a recursive approach first to understand the concept better.
this is the finest explanation for this question so far , really hats off sir , ur teaching is just next level !!
Glad to hear that
If you like my efforts, I request a review
g.page/Pepcoding/review?rc
@@Pepcoding i wanted to ask that how will we thought this kind of logic
ki last ballon 1 burst hoga or last ballon 2 burst hoga
kyunki yhi pta nhi chal pata ki recursion ki approch kya honi chaiye bs
This is legendary explanation for such a difficult problem Sir. Not only did you explain the matter, but the intuition & the confusions one can face while understanding it ❤️
We can never get this better explanation anywhere on the Internet not even paid courses. Thank You
Keep learning. It is a pleasure.
Watched for first 21:00 and then I was able to code the entire solution by myself. Best Explanation!! Thank you sir🙏🙏!!
Great the way you explain any question is really nice
Personally this channel is better than netflix.
Haha. Keep learning, Keep growing and keep loving Pepcoding!😊
Best explanation for this question. Life-saving!!
sir sawal thoda mushkil toh tha samajhna, par wohi baat hai jesa aap khete ho, dp ke block ka meaning samajh aa jaaye toh pura sawal simple ho jata hai, Thank u so much for the efforts that u give. Jitni baar aabki video dekhta hoon utni baar lagta hai ki i owe u so much for all this knowledge that i m gaining from u. Job lagti hi sir pehle aapse milne aana hai merko, baaki ke kaam hote rahenge, kyunki "EAST OR WEST SUMEET SIR IS THE BEST"
Best explaination so far, this channel is so much underrated
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
how can one be so good at teaching hard stuff wow thank you sir for this level
Sir i have been using your explanations for quite some time now and I really love these videos.
These videos are so so helpful.
Really respect the work that you have done ❤
Whatta great explanation for the problem..!!! Such an underrated channel for sure...
For better experience, visit nados.io, where you will get well curated content and career opportunities.
Finest Explanation
your explanation always go upto 1 hour but always worth investing time
how do we think of such logics in the 40-45 mins of an interview? :")
Great explanation though sir. This channel is a goldmine!
Best explanation!!
1 hr long video but every single minute is worth watching.
For better experience, visit nados.io, where you will get well curated content and career opportunities.
God level Explaination. Thanks a lot sumeet sir!!
Sumeet sir, you beauty 🔥❤️
Thank you 🙏🏼
Waah ek number explanation. Could you please also comment the prerequisite videos links which mentioned during explanation to watch before this.
Dear sir,
I am so sorry for your loss.
Tell me how can we support you!
I hope you keep smiling whatever the conditions are.
God bless you!
Konsa loss bhai?
Sir i am electronics student when I am in 3rd year then I am totally focused on gate but some time after I fell that we should have a practical knowledge but in gate everyone trying to get concepts not application of those Concept in pratical way and in India the number of psu is like a drop of water as compare to it industry companies and the work culture is like a Mangment type not application of knowledge for thease reasons I am totally confused that what should I do because coding is very tough some one tells me but when I found you then I realized that you are the best teacher of coding all teachers are good but you have a special thing which gives a lot of motivation your voice is like a postive waves which gives me a energy to succeed in his lif
Keep learning beta. Lage rahie, ho jaega.
we can use make only if g==0{} else{}
rather than making 3 if else groups
g>=2 code can be used for g==1 also
after seeing sir's solution 😂:
i thaught that sir is going to solve it by taking g==0,1,>1 as usual
but sir is legend he is ine step ahead of me 😂😂🙌🏻
Loving the dp series Sir!! You made it so simple Thank you so much
Glad to hear that
Great explaination the thing was I came for this problem but as a by product learnt palindromic , mcm also
Sir meh ye video dekh raha hu or sb samjh bhii aa raha hai pr mujhe nahi laghta ki instantly meh aese logic laga paunga jb koi new question karunga toh sir kya dp ko relete kar ke hii karna padhta hai kya
Great Explanation sir . Thank you so much
Maza hee aa gaya !!! Awesome work!
i really liked your videos ,thankyou please make more of DP
Sir, seriously mza ageya apse pdk 🥳
For better experience, visit nados.io, where you will get well curated content and career opportunities.
As always best explanation
Keep learning.
For better experience, visit nados.io, where you will get well curated content and career opportunities.
what's the time complexity of this code. is it o(n^3).
n=1000
O(10^9)
Thank you Sir !
Great explanation !
Sir,, gap strategy kaunse video me hai?
Palindrome substring
Can anyone help me in which problem sir used the gap strategy I know gap 2
How will anyone get intitution of gap method ?
Sir please discuss the recursive approach for dp problems.
Sir mai start kaha se karun aapki videos dekhna kya aapne koi playlist banai hai kya
Watched upto 27:00 and then coded it myself
Sir great explanation even knights probability was also great
Keep watching.
If you like my efforts, I request a review
g.page/Pepcoding/review?rc
sir ye exactly MCM ke trike se bi hogya , bas array ka size +2 krdia aur 0thh and last index mei 1 daldia.
hanji same he hai
Amazing explanation. Sir recursion and backtracking ka level 2 aa chuka hai ya baki hai?
39 out of 50 aa chuke
Sir awesome explaination 👌
Thanks and welcome
sir, when will be coming the level 3 of dp?
plzzz sir.
dp ke cell ki meaning dete wqt sr edkm se wqt bdl dia jazbaat dia. mtlb aisa to ekdm pehli baar assign kri meaning
hanji tricky hai questions
Sir , How to come up with intution, Every problem is different from previous one, So how our mind strike intution for DP problem
beta dp ke 150 questions solve kar lo, chahe khud chahe dekh ke. You will develop intution
awesome. mazza aa gaya
If you like my efforts, I request a review
g.page/Pepcoding/review?rc
best on YT
If you like my efforts, I request a review
g.page/Pepcoding/review?rc
Please share link of gap strategy video as well
For better experience, visit nados.io, where you will get well curated content and career opportunities.
Mazaa aaya Sirji
Thank you. If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
23/79 Done
Keep going and for better experience and well organised content sign up on nados.io and start learning from there
Iss level ka kaise soch paate hain sir ji 🙏
Keep learning.
For better experience and well organised content explore nados.pepcoding.com
thank you for this
I am glad you liked it. I also hope that you are watching till end.
If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
sir is this question on leetCode or GeeksforGeeks ?
yes, on both
sir please nlogn LIS
Sir Abhi dp m kitni video or Ani bakki h
abhi to 90 aur hain
sir, one question ... why do we consider the elements before "i" and after "j" for calculating dp[i][j]. Why "not considering" them is a problem. If you don't get my question I can explain what I am talking about.
because we want to find the value of bursting balloons of i->j(substring) beginning before we bursting it's neighbor elements. as we can clearly see that we are going from last to first. so the neighbor elements(i-1,j+1) will stay there for the whole time while we bursting the elements inside this i->j range(i.e i,i+1,i+2,....,j-1,j elements). so everytime we pick a last burst balloon we have to mulitply it with remaining balloons that will be left and that should be outside of its range. I recommend you to solve this with a recursive approach first to understand the concept better.
Sir first time mein hi aise problems solve nahi hote
Finally 😁
Aap request kijie, thode bhot dino hum bna denge video.
Thoda mushkil tha
Hope we made it easy for you.
For better experience and well organised content visit - nados.pepcoding.com
❤🔥
Keep learning.
For better experience, visit nados.io, where you will get well curated content and career opportunities.
🔥
😍❤️☺️🙏🏼
it was hard to figure out the recursive step for this
i don't know what the hell is wrong with this cpp program?????
int maxCoins(vector& nums) {
int n=nums.size();
vector dp(n,vector(n));
for(int g=0;g
I hate balloons
Burst them all