442. Find All Duplicates in an Array | HashMap | 4 Approaches | O(1) Space - No modification

[@ARYANMITTAL]

The main thing is why 2 pass is required in most optimal approach & why not 1 pass is sufficient, do understand that important portion too ❤✅

[@prateeksinghal7114]

Watching his video after 3 years.
Dude you just look so different. Kudos for the development

[@codingkart245]

I've solved using similar intuition that to keep the freq within the indices using * and / operators: int maxi = nums.size()+1;
for(int i = 0;i

[@sarankumaar6009]

what you are doing for community is really great

[@cs51904]

ek number

[@kkkkkkkkkk811]

Bhaiya please notes bhi attach kr dio kro..if possible

[@Sumit-wy4zp]

bhai tumhare jaise pro max coder kab banunga

[@johhnysans2092]

bhai op

[@TheBaljitSingh]

wow thanks

[@satwiktatikonda764]

bro waiting for 100days series