Відео

For Q-C can 'b' be calculated from 'a' using same logic without calling function for b also.

for c the recursive brute force shouldnt it be nlogn instead of just n

2nd question approach is to poor

amazing explanation keep doing it bro

For temperature balance you can easily use this approach keeping track of curr and result: ll curr = arr[0], res = 0; for (int i = 1; i < n; i++) { res += abs(curr); curr += arr[i]; } We just have to keep track of curr balance. Why this works? It's because suppose you have 3 0 0 -3 So now you have to get 3 to -3 At each 'i', you keep a track of how much you are travelling with, like here my curr = 3, at i = 1, i add 3 to res, then curr += 0, then again 2nd time, res becomes 6, after that res becomes 9 and cur becomes 3 - 3 = 0. which is correct

The explanation for problem D is horrendous.

Amazing !! Great explanation bro of Grid construction (odd) problem !!

Nice explanation bro thanks

great explanation, thanks for the video

I am coming from leetcode background and dont have mathematical intuition for problems like number 3. Anyody knowing good questions like these?

for the question B, i.e Erase first or second letter , will that approach work for removal of any character

temperature balance can easily be solved using prefix sum logic

Yo first time I solved more problems than tle eliminators editorial

Grid Construction (Even) -> had to print (1 to n) in 1st row then ( n to 1) in second and repeat the process.

for Temperature Balance problem, we can simply use prefix sum logic

Amazing video !! Explained everything clearly ! Thank you

Thanks sir

can anyone please tell me , whats wrong in this code vector<int>nums(n); for(int i = 0; i <n; i++){ cin>> nums[i]; } int next_greater = INT_MAX; int next_smaller = INT_MIN; int chef = nums[0]; for(int i=1; i < n; i++){ if(nums[i] < chef && next_smaller > nums[i]) next_smaller = nums[i]; if(nums[i] > chef && nums[i] < next_greater) next_greater = nums[i]; } if(next_greater == INT_MAX){ next_greater = 1000000; } if(next_smaller == INT_MIN){ next_smaller = 1; } int right = ((chef + next_greater)/2); int left = ((chef + next_smaller + 1)/2); cout << right - left << endl;

Temperature Q was 1235 rated 😅

Great editorial, but since this was an easy contest i wanted solutions for last 2 problems.

i don't know which level i am in competetive programming and which type of ratings question should practice can any one tell ? also i am able to solve 3 question from starter 167

Please fill the Feedback form for PCD: forms.gle/ViLGi5pQzcy4oRpv6

Considering the feedback from my last PCD, I tried to improve my pronounciation in this one. Do let me know if you guys are still facing any problems understand my speech

first 🥇

can we create a set that stores the l and r values can for each query we can just cout the size of the set

Web3 Infinity is not just a project; it's a community of like-minded individuals driving towards a common goal. Join the presale and become part of this powerful movement that's shaping the future of finance!

I'm confident in the long-term prospects of Web3 Infinity. Its groundbreaking technology and unique value proposition set it apart from the crowd.

Invest in the safest token out there - Web3 Infinity is built for massive success!

similar code in java is giving TLE at the last testcase .

nice explanation for question 3. i was stuck with o( n^3) and o(n) space earlier in the contest.

this is useful ... even after a year

Can you guys add time stamps?

I think overall it was a good discussion , but for Distnict power question it was really confusing Like didn't understand what was the root idea

how can you store answers for any length in a dp array if they have varying k values ?

B question to sirf time waste ke liye diya tha nahi karna mujhe 🤬🤬🤬🤬🤬🤬🤬🤬

you can make use of inbuilt gcd function in c++ __gcd(a,b)

c expected rating range?

The explanation for problem C is not up to the mark. I watched the explanation for problem 3 more than three time but its very difficult to understand.

5:37 no of ways to get a sum of zero from zero is one? I cant understand. Could anyone explain?

Great Explanations !!

Just Watched this video, It was a quick refresher on all the dp topics . I learned about the dp terminologies - dp states , transitions. I always tend to forget whta my dp state actually mean ..thanks for giving me insights

Starting this playlist on Dec 30 19:31 IST Let's see how it goes

Great solution for E

Solution D is soo good