Count of Smaller Numbers After Self | Leetcode June Challenge | Leetcode 315 | C++ | Approach + Code

[@nikhilpandeydigital]

thanks for explaining.
and for those who don't understand why we can not solve this by sorting in ascending order .
it is because ,
if we do sorting in ascending order then for each inversion i.e ( arr [ i ] > arr[ j ] ) we will be counting the number of elements from which the element arr[ j ] is smaller.
but we have to count the number of elements which are smaller than the element arr [ i ]. this can be achieved by sorting in descending
order.

[@himanshiagrawal1639]

Similar problem- count inversion in an array problem

[@logicoverflow1240]

Please also explain, how to solve this using AVL tree 🙏🏻

[@mandeeppanghal4990]

Jo main line thi wo toh samjhayi hi nhi
Baaki Puri ramayan samjha di ☕

[@manasjha109]

Really nice explaination, Thanks!! understood and coded your approach in just one go. Keep making such videos.

[@AyushiSharmaDSA]

Thank you Manas :)

[@iampatelajeet]

Literally great explanation di, thank you. Aapne ye git repo kaise banaya step by step, ek video bana do pls.

[@setiyakitchen]

class Pair{
int element;
int index;
Pair(int element,int index){
this.element = element;
this.index = index;
}
}
class Solution {
private void merge(Pair[] elements,int low,int mid,int high,Integer[] counter){
Pair[] temp = new Pair[high-low+1];
int left = low,right = mid+1;
int k = 0;
while(left

[@immrhrr]

Well tried🔥

[@anantmani4267]

kuch smajh nahi aya

[@haidarmohammad8510]

I think you missed base case(i.e. if left>=right return;)

[@purushotamkumar9596]

Please make more such videos

[@AyushiSharmaDSA]

Sure :)

[@puspendrayadav8931]

Thanks for such a crystal clear explanation.

[@AyushiSharmaDSA]

Thanks Puspendra, glad it was helpful 😊

[@avneet12284]

Superb explanation.

[@GokuVidhayak]

best approach with best explanation

[@AyushiSharmaDSA]

Thanks Lucifer :)

[@technologybaba192]

Thanks

[@AyushiSharmaDSA]

Welcome :)

[@lakshaybansal9597]

really nice explanation

[@aishwaryaranghar3385]

videos going better!!!

[@AyushiSharmaDSA]

Didn’t realise until this comment, thanks 😊

[@AyushiSharmaDSA]

Didn’t realise until this comment, thanks 😊

[@nishantgarg2815]

Nice clean solution

[@AyushiSharmaDSA]

Thanks Nishant :)

[@vikaspanwar5194]

congrats for starting your journey with walmart

[@AyushiSharmaDSA]

Thanks Vikas😊

[@saimhatre89]

Thanks for the amazing explanation

[@AyushiSharmaDSA]

Thanks Sai :)

[@SachinTiwari-lr8zb]

Well Explained, Thanks:)

[@AyushiSharmaDSA]

Thanks Sachin, glad it was helpful :)

[@BalwantSingh-mb7to]

☆☞Avl tree pe bhi bna do kripya kr🙏

[@AyushiSharmaDSA]

Zaroor. 👍🏻

[@adeep936]

Great video!! Could you please explain more on why we are merging in desc order? What if we had used the merging in increasing order?

[@AyushiSharmaDSA]

Because here we want to find the numbers which are smaller than the element after it.

[@decostarkumar2562]

I think , we could also do it by sorting in ascending order but the code would become messy and a lot of cases have to be covered . But if sorted in descending order one can directly get the desired smaller elements clearly

[@asmitpapney4671]

Thank U very much ❣️

[@AyushiSharmaDSA]

Welcome 🙂Glad it helped.

[@oqant0424]

simplest explanation ever

[@AyushiSharmaDSA]

Thank you :)

[@erz_mafia]

mostly sound is coming from right earphone .....didi please correct the sound

[@AyushiSharmaDSA]

Yes, working on the issue. 👍🏻

[@a264virendrakumar2]

Great work ❤️👍

[@AyushiSharmaDSA]

Thank you :). Please share with your friends and juniors.

[@AshishKumar-ww1mr]

noicee explanation .

[@AyushiSharmaDSA]

Glad you liked it🤗

[@yogeshagarwal403]

Well explained

[@AyushiSharmaDSA]

Thanks Yogesh🤗

[@InderjeetSingh-eb8py]

Vry well explained

[@AyushiSharmaDSA]

Thanks🙂

[@vikaspanwar5194]

thanks a lot

[@AyushiSharmaDSA]

Welcome Vikas😊

[@Rajat_maurya]

Thank you

[@AyushiSharmaDSA]

Welcome :)

[@ritikkhatana5105]

Appreciated 👏

[@AyushiSharmaDSA]

Thank you :). Please share with your friends and juniors.

[@vaarigupta6332]

WHy it is V[i] = temp[i-left] not v[i] = temp[i] ? I am not able to understand this line. Can somebody tell me?

[@rajneeshyadav9728]

bcz temp is starting with index 0 and V is starting from low ...

[@Mandeepsingh-jo5cf]

thanks!

[@AyushiSharmaDSA]

Welcome Mandeep :)

[@manpreetsinghpanesar5748]

👍👍

[@AyushiSharmaDSA]

Thanks🙂

[@shivsagarshah24]

Nice Explanation!!!!!!!!!!
pls make a video on avl too..

[@AyushiSharmaDSA]

Okay, will make ASAP🙂

[@yogeshyts]

very bad

[@ayushsinghtomar5245]

Why all aayushi 's are toppers 😂😂

[@AyushiSharmaDSA]

Ohh, that needs to be checked on🤗😂

[@riteshchoudhary9745]

Thanks ayushi, simplest explanation ever (•‿•)

[@AyushiSharmaDSA]

Thanks Ritesh :)

[@incongnito12]

but how is this not n^2-> for n/2 elements ( Left half) you are going through n/2 elements (right half) -> n/2 * n/2 == n^2

[@sauravchandra10]

This is a standard Merge sort, so will have the same TC. And yes we are comparing n/2 elements with n/2 elements but for every element, we are not comparing with n/2 other elements

[@incongnito12]

@@sauravchandra10 yep gotit

[@jatinsingalEARCS]

please explain avl tree

[@AyushiSharmaDSA]

Sure will make a video on it :)

[@jatinsingalEARCS]

@@AyushiSharmaDSA thanks

[@SACHINSINGH-re5ft]

aapki aawaaz bahut annoying hai

[@gowthamreddyuppunuri4549]

JAVA code
class Solution {
static class Pair{
int val;
int idx;
Pair(){
}
Pair(int val,int idx){
this.val = val;
this.idx = idx;
}
}
int[] constructLowerArray(int[] arr, int n) {
// code here
// for particular i and j
// arr[i] > arr[j] && i

[@nitin5865]

Thanks ayushi, simplest explanation ever (•‿•)

[@AyushiSharmaDSA]

Welcome. Glad it helped :)

[@sushilugursandi130]

Jhut bolta h sala