L02:ARRAYS , Maximum Absolute Difference , Interview Bit

[@ankitgoyal8556]

Go for it, it's crisp and short and easy to understand. Thank you

[@drayc290]

I have a crucial doubt. When we are simply subtracting max of one of these quantities from the min, how are we sure that the (i,j) pair that gives the max and the min respectively, satisfy the initial conditions of that case in the first place? Like let's say index i has max(x + a[x]) and index j has min(x + a[x]). When we subtract this quantities we are not making sure that i > j and a[i] > a[j]. So how are we still getting right answer?

[@sanjeeeeev]

there is no condition for i and j

[@harshitavyas7497]

I ALSO HAVE SAME DOUBT

[@dakshsingh5891]

Value of i and j can be anything it doesn’t necessarily have to be i>j and similarly this is also possible a[i]

[@RiyaSingh-mq1vb]

Great Explanation

[@nayanbhuyan8156]

If you want to solve standard problems for interviews, try making videos from the Love Babbar 450 questions of DSA

[@kartiksaini135]

What Algorithmic tool does it use?? (Greedy or DP)

[@gayathri-8-i6s]

Why we avoided the negative part??

[@anshumansingh510]

thought process deserves 5stars

[@heyya7357]

Finally got the best solution of this problem

[@gyr8567]

Your brute force approach was neat. I would also like to see the efficient approach

[@rithikrk3695]

thanks man

[@RAHULKUMAR-xy4wz]

Nice explanation with the right approach.

[@SuperPrksh]

Sir how to develop such kind of intuition to solve this kind of questions?

[@ARYANMITTAL]

These are some standard problems , soon you will find that they occur many times so ultimately you will get used to this !!

[@piyushkumarrajput2779]

​@@ARYANMITTALsir, can you please make a playlist of those problems. so that we can develop such intution. thank you in advance

[@gayathri-8-i6s]

@@piyushkumarrajput2779 yes . We will get benefitted if he do so

[@amansingh.h716]

its impossible till we see some kind of solutions ,thats why i hate DSA

[@PaAGadirajuSanjayVarma]

ALso what about third and fourth case bro??

[@parthsinghparihar1904]

Can u make a video on "Partition"prblm of array section, interviewbit

[@srikanthtekumudi3948]

very clear explanation...thank you....

[@Learnwithpractice960]

thanks bro this video helped alot

[@parthsinghparihar1904]

Well explained!!

[@dheerajchaudhary645]

Why can't we directly use this-> abs(max(arr) - min(arr)) + abs(index(max(arr)) - index(min(arr)))

[@nirajgusain1452]

because it will give you wrong ans, try to dry run on your own, with some negative values.

[@faizankhan5877]

Great

[@atulvidyarthi133]

great explaination

[@hiteshusingh8571]

great explanation

[@PaAGadirajuSanjayVarma]

bro but last example in interview bit says as follows: f(2, 3) = f(3, 2) = |3 - (-1)| + |2 - 3| = 5 Here |2-3| should be -1 as per your formula (of Modulus) but in order to get result of 5 it should be 1.So plz tell me bro??

[@sita476]

its better to take example while explain

[@saurav4180]

Advertisements every minute making it worse.

[@devendersinghrathore8837]

geeksforgeeks pe solution dekhke to koi bhi smjha sakta hai//

[@harshitavyas7497]

I have a crucial doubt. When we are simply subtracting max of one of these quantities from the min, how are we sure that the (i,j) pair that gives the max and the min respectively, satisfy the initial conditions of that case in the first place? Like let's say index i has max(x + a[x]) and index j has min(x + a[x]). When we subtract this quantities we are not making sure that i > j and a[i] > a[j]. So how are we still getting right answer?

[@harshitavyas7497]

@alfred whatever i did, how it is bothering you?

[@harshitavyas7497]

@alfred Sometimes a problem raised by someone is not resolved timely and when others also face the same problem they also raise the issue so that it becomes visible and solved. Hope you understand.