2856. Minimum Array Length After Pair Removals | Leetcode Biweekly 113

*************************************************

*************************************************
Timestamps -

00:00 - Agenda
00:25 - Problem Description
02:53 - Solving a simplified problem - Array contain unique elements
05:50 - Array contains non-unique elements
10:05 - Which arrangement is best?
17:55 - Solving for odd length array
19:35 - Code Walkthrough

*************************************************
Interview Experiences Playlists -

*********************************************************************

Please show support and subscribe if you find the content useful.

[vikashgupta]

great explanation, I have been watching ur video for contest Qs since few days and I really love the effort u make us to digest some facts with lots of possible testcases.

[itsmepratham]

great explanation keep uploading the videos

[abhinaykumar]

Thank you for awesome explanation of this problem.

[shubhamsingh-tqix]

great video man ! learnt a lot . can you share some reading resources for two pointers.

[coderhumai]

bro you solved the problem with that much background noice
😝😝
😉

[akshatpandey]

I did this question using Majority Element concept (Moore’s Vooting Algorithm)

[xiaoshen]

Good video but why did u record it underwater 😅😂

[SD-vkko]

Hey Mohan, Video is awesome as always. but there is huge problem with mike/voice. Please fix it

[dayashankarlakhotia]

class solution {
public int min length After Removal (List <interger >nums){
int n=nums. length;
int ans=nums. length (), i=0, j=(n+1)/2;
while (i<n/2&&j<n){
if(nums.get (i)<nums.get (j)){
ans-=2;
}
i++;
j++;
}
return ans;
}
}
hare ram hare ram.well explanation thanks 🎉❤😢