bhai dp ke problem solving ke resources suggest krdo, identify toh ho jaati hai, dp ki problem hai par state aur transition sochne waqt bilkul blank ho jaata hu
Ye sabhi k sath hota h start me. I would suggest Just start practicing, easy level questions of dp from leetcode if you get confident from easy one switch to medium level and then hard. And also try to remember it's pattern so that if next time you tackle the same kind of problem then you can apply its logic to that problem. And in the initial phase try to write recursive dp solution rather than iterative. Also just try to spend some time on the problem and if still you didn't get any logic then just see its minor hint rather than seeing the solution directly and then try to solve, if u are able to solve then it's ok otherwise you can see the solution after spending some time. Just follow it for a few weeks, it will improve your dp. But try to practice as much different dp problems as you can.
@@pretestpassed157 ok bro, mera emphasize bhi problem ka main idea as a hint lene ka hota hai, rest implementation part mein mera koshish rehta hai ke mai hu code likhu aapne idea ka, thanks for being actively replying :)
@@pretestpassed157 Max total damage waala, usme keh rahe hain ki value -1 , val -2, val +1 and val + 2 nahi le sakte hain, lekin code main hum sirf aage ki values he check kyun kar rahe hain?
Islea q ki hm phle se hi wo vector pair ko sort kar dea h, fir hm 0th index se uss vector pair ko traverse kar rhe to 0th index k baad to 1 index hi aayega fir 2 , 3 , and so on. To hm just next index jo ki 1 h uss se sath me puch v rhe ki tmko le ya naa le to isse tmhara sara case cover ho jayega islea hmme piche Jane ka jarurat hi ni padega.
I didn't participate in the Codeforces contest yesterday. Because of some personal work and it's unusual timing. If I will get some time, will try to make it's editorial too.
Nice explanation 🔥🔥 thanks for sharing
Thankyou
Thanks for Sharing
Thanks
nice explanation ❤ keep doing ,helpful.
also upload codeforces contest qs.
Thankyou
Acha explain kiye... thanks
Thankyou
Great Explanation!
Thankyou
@@pretestpassed157can we connect over discord? _grimo
thank u bhaiya
dp nhi pehchanne ko ata ki ye q dp ka h
Koi na practice karo dhere dhere aane lagega
bhai dp ke problem solving ke resources suggest krdo, identify toh ho jaati hai, dp ki problem hai par state aur transition sochne waqt bilkul blank ho jaata hu
Ye sabhi k sath hota h start me. I would suggest Just start practicing, easy level questions of dp from leetcode if you get confident from easy one switch to medium level and then hard. And also try to remember it's pattern so that if next time you tackle the same kind of problem then you can apply its logic to that problem. And in the initial phase try to write recursive dp solution rather than iterative.
Also just try to spend some time on the problem and if still you didn't get any logic then just see its minor hint rather than seeing the solution directly and then try to solve, if u are able to solve then it's ok otherwise you can see the solution after spending some time.
Just follow it for a few weeks, it will improve your dp.
But try to practice as much different dp problems as you can.
@@pretestpassed157 ok bro, mera emphasize bhi problem ka main idea as a hint lene ka hota hai, rest implementation part mein mera koshish rehta hai ke mai hu code likhu aapne idea ka, thanks for being actively replying :)
Bhaiya, hum value-1 aur value-2 ka case handle kyun nahi kar rahe hain yahan? Sirf aage he kyun check kar rahe hain?
Koon sa problem B ?
@@pretestpassed157 Max total damage waala, usme keh rahe hain ki value -1 , val -2, val +1 and val + 2 nahi le sakte hain, lekin code main hum sirf aage ki values he check kyun kar rahe hain?
Islea q ki hm phle se hi wo vector pair ko sort kar dea h, fir hm 0th index se uss vector pair ko traverse kar rhe to 0th index k baad to 1 index hi aayega fir 2 , 3 , and so on.
To hm just next index jo ki 1 h uss se sath me puch v rhe ki tmko le ya naa le to isse tmhara sara case cover ho jayega islea hmme piche Jane ka jarurat hi ni padega.
@@pretestpassed157 Ohh okay bhaiya, thank you so much.. aap bahut acha padate ho bhaiya!!
Thankyou
codeforces ka
I didn't participate in the Codeforces contest yesterday. Because of some personal work and it's unusual timing. If I will get some time, will try to make it's editorial too.
apne konsa extension lagaya h lc mai jisse company tag show hote h??
It was Big Omega Chrome Extension