วีดีโอ

great though!

this portion is confusing .. ll other1=n/k; ll other2=n%k; ll ans1=(other1*(other1-1))/2; ll ans2=((other1+1)*(other1))/2; ll ans3=(ans1*(k-other2))+(ans2*(other2)); cout<<ans3<<" "<<maxi<<" ";

first video that makes sense of this ques and actually tells how to solve it easily thanks..

Best Explanation I could have asked for a pretty simple solution but hard to really understand what is going on, well for me atleast Thanks man Really appreciate keep up the good work It takes a genius to make it simple...

it is wrong code

Not a good approach , anyone can do using in-built methods

I can't believe , you explained in a simple way in just 9 minutes, Great Work!

not a good way of explaining! (feedback)

this solution is showing TLE now

hey, i watches your tutorials while solving some old cp problems but you have stopped making editorials and ig even stopped doing cp, you have the ability to explain things clearly and it would be nice to watch your tutorials for new problems as well!

Very good explanation!!!

make a code to fix low volume on videos

thanks a lot. didn't expect to find such a clean solution for an old problem!

This is possibly the worst explanation for any problem that I have ever seen. I'm sorry.

Nice explanation, i loved this question one of the most beautiful questions

nyc

your teching method is not understantable .......

Explained it well, thanks 😊

(n-3) kahase multiply hua/

poor explaination :/

its a simple question but i thought too much of it

I don't think its the good solution because if we see in terms of m & n, the time complexity would be very very large,..Clearmat function alone would take O(m*n),..

i have solved it on my own by one test case fails everytime :(

nice, did the same. I was not able to think of the State

Great video man!

bro how it find the missing index if 4 is missing nums[3]=5-1=4=mark nums[4]=??? then how it give it is positive or neg??

awesome

Why there are no comments for beautiful solution ❤

voice kafi low h video ki bhai

But if you don't take..... Thus go in the last slice and take it. Then still the slices are left that you left behind. Also the game should be played until the slices are end. Then what about this case?

nice bhai

sound is pausing every few seconds. it's disturbing

Thank you! All starts are hard, hope eventually when I finish the playlist it becomes easier

great explanation

Great explanation!

Great Explanation

brother, we know that lcm can not be less than R so we can say that the answer is l,r if 2*l <= r why It's not working?

sqrt(8) != 4 , please at-least take and solve examples correctly while explaining

Describe it more approach is nice but need more clearity

please share optimsed solution also

Unable to understand what the logic behind the -ve b makes sense mathematically but don't makes me sense in the normal way aagar bina mathematics ke it don't makes me sense

cant we reduce he search space this seems too large

Thanks for explanation

That was a nice explanation! Thankyou so much.

Does FTE only join after obtaining a degree or can join before if selected through campus placement ?

Time limit exceeded

dwarfed the problem🤔

it too bad explanation

Well explained, but I think the code can be reduced and improved

Nice work. You can optimise a little bit by removing redundant code. just check "total == diff" once and perform the "while total == diff" until you get the best j and after you break you can check only once if(a[i].first-a[j].first+1<mini) inside the "total == diff" case and that would work as well. Good job though helped me get the intuition for this question.