Product of Array Except Self | 4 Approaches | Detailed Explanation | Leetcode 238 | codestorywithMIK

[@shloksuman8164]

mazhar in every 'medium' problem : " Medium marked hai par kaafi Easy hai" 😅😅 really good explanation

[@EB-ot8uu]

ha ha. true. Ye Qn marked Medium hai, but hai kaafi easy 😅

[@Coder_Buzz07]

Mik bhaiya big fan thank you for posting videos everyday 😊it helps a lot

[@amanjha3346]

wow i saw the streak which was 383 days and i was wow that's awesome really awesome

[@spaul7172]

It takes a lot to inspire. U have my respect 😌

[@deependrapushkar2528]

nice explanation !!

[@Dezy_Kri]

Nice explanation

[@theOmKumar]

vector productExceptSelf(vector& nums) { int n = nums.size(); vector res(n,1); int prefix = 1, suffix = 1; for(int i = 1; i < n; i++){ prefix *= nums[i-1]; res[i] *= prefix; suffix *= nums[n-i]; res[n-i-1] *= suffix; } return res; }

[@tutuimam3381]

Amazing explanation ❤❤❤

[@kundankumar-zl3qq]

O Bhai osm explanation!

[@whothefisyash]

crisp explanation

[@Marcusparker-vu4pr]

Keya demaj hai bhaiya apka_ medium wala question ko v easy se v easy matlab basic wala question bana diya_. Kuch tips do bhaiya_ kaise bana leto ho Aisha approach

[@anmolverma075]

God level explanation !

[@gauravbanerjee2898]

Thanks a lot bhaiya ❤❤

[@fourthdimension6515]

you are just amazing bhaiya

[@aryanZzz..]

Bhaiya plz make video on leetcode 2831,also explain one thing sb logo ne is question me explain nhi kiya jb window ka size reduce kiya hai tb agar maximum frequency wala element out of window jaa rha h tb bhi maxf(count of most frequent element in that window) ko same he rkha h reduce nhi kiya?? bohot confusion hora h isme

[@sanketsinghal6178]

Bhaiya in the last approach again we have used an extra space array? So the actual space complexity should be O(N)

[@kushaalrana]

Yes I have the same doubt

[@codestorywithMIK]

In 4th approach, we took result and we calculated the answer in that only. Since this result need to be returned, we can ignore it. In 3rd approach we had to take left and right apart from result array. So it depends, you can consider the space taken by result array or you can ignore the space taken by result array.

[@parvahuja7618]

mazhar bhai aap humare mazhiyah ho

[@oqant0424]

POTD DONE [15.3.24] ✅✅

[@aws_handles]

big fan bro

[@kushagrapandey8898]

i tagged you in my tweets please check and guide am i going in write direction or not?

[@sanketjagtap9350]

Approach 2: If the count of 0 is greater than 1, then the whole result array will contain zeros.

[@sportsplanetx5832]

i love you. is se xada kia bolu bhai

[@dayashankarlakhotia4943]

public int[]productExceptSelf (int[]nums){ int n=nums.length, int[]ans=new int[n]; int product=1; for(int i=0;i=0;i--){ ans[i]*=product; product*=nums[i]; } return ans; }