Codeforces Global Round 26 | Video Solutions - A to D | by Abhinav Kumar | TLE Eliminators
ฝัง
- เผยแพร่เมื่อ 31 ก.ค. 2024
- Here are the video solutions in the form of a post-contest discussion for problems A, B, C1, C2, D of Codeforces Global Round 26. The live discussion was done with students of TLE Eliminators, this is the recording of the same. We hope this will be useful for you in up-solving this contest.
📢Check out handpicked problems by Priyansh himself, on our CP-31 sheet: www.tle-eliminators.com/cp-sheet
Solution Codes:
Problem A: codeforces.com/contest/1984/s...
Problem B: codeforces.com/contest/1984/s...
Problem C1: codeforces.com/contest/1984/s...
Problem C2: codeforces.com/contest/1984/s...
Problem D: codeforces.com/contest/1984/s...
Be sure to check out TLE Eliminators.
Website: www.tle-eliminators.com/
Instagram: / tle_eliminators
Linkedin: / tle-eliminators
Twitter: / tle_eliminators
TLE Community Discord Server: / discord
Timestamps:-
0:00 Problem A
10:31 Problem B
25:25 Problem C1
46:45 Problem C2
1:11:45 Problem D
Please fill the feedback form for PCD: forms.gle/bY2hVPfo4bQTZMws6
Sir, Please also upload solutions for Leetcode Weekly Contest 401.
When explanation is aligning to your approach and you understand everything and your confidence is boosted. Best Feeling!
Great Explanation !!
keep up the good word bro🙌🏻
Where is Leetcode Weekly 401 Disscussion
How many problems did u guys solve?
Great Explanations 🔥🔥🔥
Great explanation
superb explanation!👍👍👍👍
Great Explanation
🔥🔥🔥🔥
very good explanation
pls also upload solutions for lc weekly and biweekly contest
great
Bhaiya can we think like
Have to make change only the index where there is a maximum suffix sum
yeah.. this would also work.
actually, if u see, it is the same thing..
*index of minimum prefix sum = index of maximum suffix sum*
(bcoz suf[i] = totalSum - pr[i-1])
@@abhinavkumariitism so then it will also work in c2?
@@JIGARSINGTHAKOR-yy6qp yep.. but for calculating the number of ways here.. u will still have to check the count of +ve/-ve in the prefix sum array only.. so prefix sum is needed to be calculated anyways.
c1 question ko dp se nahi kr sakte kya
kr skte he
@@harshilsavaliya5909 code bhej sakte ho kya mera option 2 me problem kr raha h
@@harshilsavaliya5909 bro tle dega
why and how prefix and suffix sum helping to get the index of min c and then doing abs of both and giving result with pr[n-1] should i get most negative element of prefix sum ,and add the 2*abs(minimum c) to the last element of prefix sum if c is negative,by the way, that graph cleared everything
Late ae latest ae
In B question the fourth condition might be wrong for 10 as TC as we get a zero but this number can be made using 5 and 5
Watch it again once..
The 4th condition is that, all remaining places *(except unit's place)* should not contain 0.
In "10" you have the 0 at "unit's place", so that's ok..
for the unit's place we have the condition that we should *not have a 9* there.
Should I delete the comment so it doesnt create confusion?
@@akhileshagarwal5913 no problem,.. i've clarified it.
C1 que is still not clear to me
I came 1-D dp solution,by creating the recursion tree of each move, try creating it on paper and you will see at every level there will a minimum and maximum value you just have to store it in your dp.then, at each iteration calculate the cur value with min and max value stored in the previous idx of dp at the end the maximum value will be stored in your dp last value
Explanation is good man, rewatch it once, thoda tricky laga as a beginner but good question.
@@swarbhatia yes
@@SatyamYadav-wh1zf can u share share dp code
Can u tell which part is not clear..? I can try to elaborate a little more on that part.
Great explanation
Great explanation