Code & Notes: drive.google.com/file/d/1idh2GHvawPRvYUqvV4rGWkX_rToLEav6/view?usp=sharing Kon kon logic soch liya tha Binary Search and AP ka ?? 💪

@roshanraturi6450

Жыл бұрын

ME BUT IMPLEMENTATION NHI HO PARHA THA THIK SE ..THANK YOU FOR YOUR INTUTION && LOGIC

Clearly Understood the intuition thanks!

Great explanation. Thanks Aryan.

gr8 bhai

Best explanation so far!

Thanks for the excellent explanation

Great Explanation!!!

Best explanation 🔥 Keep going aryan

Best explanation!

excellent explanation made my day

Nice explanation thanks!!

Thanks for the help bro.🙏

suchh a great explanation

Thank You :)

what if you have repeating numbers so say ur trying to make 18 with an array of 5 with index 2 maximized so you might have 34443. How do you apply n(n+1)/2 to it?

nice explanation thanks .

Its giving runtime error signed integer overflow even after using long long int what to do brother

Thanks bro...

Man this is brilliant

hey why are we taking ele as mid -1 not simply mid

Hey Aryan, I regularly watch your videos... Thanks for all the effort you put in. I have a question, if you don't mind answering, is, How much the solution will differ, if the question would allow "0" in array?

@ialgorithms

Жыл бұрын

Thanks for bringing this up, I was on the same page. If 0 is allowed (or the range was 0 < i < n), then nums[index] will be maxSum. Values to the left of nums[index] will be 0 and right will be 0. Which satisfies other conditions.

@_hrishav_

Жыл бұрын

@@ialgorithms If nums[index]==maxSum & all other indices have 0, then how will "abs(nums[i] - nums[i+1])

@ialgorithms

Жыл бұрын

@@_hrishav_ The question asked in this question (First comment) has no correlation with the actual problem statement. It's a though process which occurred when solving the problem for the first time presuming that "0" was allowed in the array list. So, you could ignore this comment as it has nothing to do with the actual question. To your question, abs(nums[i] - nums[i+1])

Hi Aryan, should the leftpart and rightpart of the array (excluding index) always be array[index]-1. Cant it also be array[index]?. In simple words shoud ele=mid-1 or it can be mid also. Because I have seen results like [1,2,2,1] where index is 2. Can somebody explain this.

@arshgupta9038

Жыл бұрын

it can be array[mid] as well. it can also be array[index]-1.In order to minimise the sum we do array[mid]-1. [1,2,2,1] could also be written as [1,2,1,1] .We try to minimise the sum , so we can get the max value at index which can pass the sum condition

bhaiya just a small and silly doubt, how do you determine that we can't make the array just by knowing the limit is e^9? ik its related to time complexity but then till which range can we make the array or check for each number?

you are f***g smart

Thank you, you are the best. One question, inside of while loop, why el should be mid-1? It can't be mid?

what are the earlier 2 concepts

if the array contains negetive numbers how to find the sum

plz upload the leetcode contest solutions as well

Maybe this is a silly question, but why are we taking el =mid - 1?

@kushagraahire1871

Жыл бұрын

0 based indexing

@anzilmufti2682

Жыл бұрын

@@kushagraahire1871 why are we even taking el=mid-1, i mean what's the logic behind it

@kushagraahire1871

Жыл бұрын

​@@anzilmufti2682 Logically it is not compulsory to take mid -1 , we can take mid also the code should run

How at 7:26 array sum is equal to maxSum as array sum is 10 and array sum is 11

@aurobindsahu4355

Жыл бұрын

ye mujhe clear nhi hua

your explaination is good but try to explain slowly.

can someone please explain how to learn from given constraints

@password47403

Жыл бұрын

I also had a similar doubt as to how to analyze the constraints properly...check out this video of Aditya Verma where he shows how to analyse the constraints! All The Best!

@sravanigundepalli3513

Жыл бұрын

@@password47403 Okayy thank you :)

explanation - INT_MIN, but but but but but but but but but = LONG _MAX

can you please send the link of the two questions having the same concepts as of this question?

@ashishdhal4614

Жыл бұрын

Try solving search space problems in striver's a2z sheet

@raginibhayana8305

Жыл бұрын

@@ashishdhal4614 thank you

I had to lower my sound to a minimum to keep listening to the explanation. I understand, you try to be different from others, but your main content is an explanation, not entertainment. The result of the video should be an understanding of the solution and key points learned, not the headache.

Feels like should drop programming..

bhaii thoda over acting kam kiya kar.

butt butt butt band kar bhai

Thanks for the excellent explanation