Відео

Thanks for the video solution. The above code for Problern C was failing the test case when N = 7 and queries = [1, 4], [1,3], [1,5 The expected output is [4, 4, 3], but the actual output is [4, 4, 2]. I figured out what was going wrong with that solution. We were also counting the already deleted nodes we were only supposed to count the non deleted nodes between queries[i][0] and queries[i][1]. We have to just add one condition while counting which is make sure that it was not deleted. Thanks to TLE Eleminators, I really enjoy watching your videos.

for problem c , there will be z which maybe fraction of y isn't it? , and after a certain number there will be always a possibility of y%(x xor y)==0 , as msb of both will be equal , isn't it?

What IDE did you use? I assume that you're using a Mac machine.

c question was too cute, thanks for explaining

literally the best bitwise video, clear and straight to the point, thanks a lot.

I'm proficient in java... Don't want to go with cpp

goat

Can anyone help me ?? Why this code is not working Q: MINIMUM ARRAY SUM class Solution { public: int recursive(vector<int>& nums, int k, int op1, int op2, bool choice1, bool choice2, int count1, int count2, int index) { if (index >= nums.size()) { return 0; } int option_1 = INT_MAX; if (!choice1 && count1 < op1) { option_1 = ceil(nums[index] / 2.0) + recursive(nums, k, op1, op2, true, choice2, count1 + 1, count2, index); choice1=false; } int option_2 = INT_MAX; if (!choice2 && count2 < op2 && nums[index]>=k) { option_2 = (nums[index] -k) + recursive(nums, k, op1, op2, choice1, true, count1, count2 + 1, index); choice2=false; } int no_option = nums[index] + recursive(nums, k, op1, op2,false,false,count1,count2, index + 1); return min(no_option, min(option_1, option_2)); } int minArraySum(vector<int>& nums, int k, int op1, int op2) { return recursive(nums, k, op1, op2, false, false, 0, 0, 0); } };

i would suggest one thing while wrttingggg the title of video A to D you should also mention the question number as many people search question with the question no. like solution of leetcode 3361

Can i talk with you

can someone explain the correct mathematical approach for problem B instead of binary search?

great explaination

great explanation sir

great

do you have code for the problem D

bro easily said C is easy , now it will take me hours to digest this question !!

Your number please

codecheff ka dalo

Nice explanation In problem c1, would iterating over the min (m ,smallest power of 2 greater than x ) also work?

Thankss sir 🫡

SIR thanks you for Biweekly

TLE 12.0 - our Competitive Programming course TLE 12.0 is live! Enrol now at www.tle-eliminators.com Please fill the Feedback form for PCD: forms.gle/yJ4SJ6hikHeN3aG1A

TLE 12.0 - our Competitive Programming course TLE 12.0 is live! Enrol now at www.tle-eliminators.com Please fill the Feedback form for PCD: forms.gle/rryVKQ5VVTo9kvK1A

apart from the dp logic, I really loved the way of writing code in Q3. Where to learn these intricacies of lambda functions?

TLE 12.0 - our Competitive Programming course TLE 12.0 is live! Enrol now at www.tle-eliminators.com Please fill the Feedback form for PCD: forms.gle/xFQ8pumGQP2qUaGw6

Why a vis vector is even required ?

No one can explain like you. Great explanation of c. <3

This is really insane.Really helpful.

Will this sweep line work if we have to take xor rather than decrementing.

Very clear explanation.Thanks for making this video

Such a mind-blowing technique. Thanks for such a nice explanation ❤

I never usually comment but this content on graph is on fire🥶

Pls upload codeshef editorial

Where's div3 and codechef editorial?

The last problem solution is not getting accepted in LeetCode.

thanks :)

Loved the Explaination

Pls upload solutions for Codeforces 988 div 3

was stuck on D and you explained it nicely

In 4th question, in checker function you missed one case when abs(y - x) > max_diff: there we have to keep all x or all y for continuous -1's. [2,-1,4,-1,-1,6] -> [2,3,4,5,5,6]

There is a fault in your code for the 4th question . Leetcode added one more edge case "2,-1,4,-1,-1,6" and will be 1 and sir your code gives us 2 .

The code for 4th problem is now failing for this testcase, so something wrong with the approach? [2,-1,4,-1,-1,6] Output: 2 Expected: 1

Very Helpful, Small video but very efficient..

the bullet example was great i immediately got why we are doing the process after that example