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.

worst naming of variable i have ever seen

kya bol raha hain khud samajh raha hain kya? English bola zaruri hain??

bad explanation

Please correct problem number

Regarding Leaping task, while i was watching for first time it was really frustrating for me but after a quick 2nd recap it all made sense

Great video I think we can use stack to get rid of using timestamps

best one by far...Can you explain why did you take 1e11 in mini?

yeh bkl ytuber bnega haha rxxndva

great

Brilliant solution, explanation and code!

u know what the most comedy problem in seen in leetcode yarr ,bcs code logic is already return in question😅

useless video. i have already sovled this problem with this O(n*m) complexity came on youtube for watch a better solution . if you wanted to make the vedio solution then it should have been a better solution of O(n+m) time even a child can solve O(n * m). just don't upload videos on youtube just for shake of it. time waste

wooow now i get it fot the first time after watching so many lectures

best explanation found!

great explanation

tq 😘

Perfect :)

Thanks for the awesome explanation

Hi, Juraj here, one of the maintainers of Cyclops 👋, Loved the video, great to see it from the perspective of a contributor!

Bhai difficult concept h hindi m pdhaya kro

Excellent Thank you so muchhhhhhhh

very good explanation bhai even i can't solve it

in second question why did you take that condition, like that condition will never come right as we are eliminating all the odd n so a can never be even

It's also Pirates of carribbean

Bhai , everyone does cp in c++. I am learing dsa in java. How to do cp in java? or should i swtich to c++.? Can you give resources how to start cp in java, or should i switch to cpp

nice solution man. loved it

What I love here is that he is focused on the problem while his family is just going about their daily routine as if he isn't doing anything. hehe

GREAT EXPLANATION ❤

Insightful.................