Bhaiya so this is also your channel 😅

nice

bhai kanpur se ho kya??

nc bro

You are like something something Babu Rao ganpat lal aapte 😂😂😂😂😂😂😂

Jai shree ram bhai

great detailing in 11 mins

keep posting u r a good teacher

Woah bhai bhai!

Brilliant technique❤

bhaiya multiplailer ka kya kam tha?

nice explanation , keep up the good work

Thank you dada

funny guy :)

I understood - there are n boxes having n types of balls; we have to swap them n order to make condition when each type of ball is in respective container. ex - type1 balls in cont1, type2 in cont2 so we have to just check there are equal number of each type with balls present in that container. ex- we want all balls of type1 in cont1, type2 in cont2, so we have to ckeck number of balls present in that container is equal to number of balls present globally for that type.

good explanation........bro

ram ram bhaiya thanks

Best sol i ever found

summery : We are total number of element in specific row is equals to number of that kind of element in all of the bowls.

Bhidu Gajjab ka explaiation hai. Please make more videos on leetcode question

bhai isko bolte hai logic ...fantastic!!!

Nice bro.Keep it up. Simple and precise explanation!

why we returned i+1 and j+1 shall not we return i and j only?

aapka kitna pacage laga hai ?

Sawal jaye bhaad me! Bhai ne Ram Ram bola hai! I am gonna play "Bharat ka bacha bacha" song and dance!!

bhai intuation toh bataya kro ????? sirf saval kardena is not the solution

Ram ram bandhu, playlist delete krdi kya?🤔

desi style mast laga👌👌

Your speaking style is so comfortable to hear, i feel my elder brother teach to me. I watch many channel to understand this question but here i satisfy my answer. Thank You☑

guruji kha ho yrr

osmm

ohh man! this thing is awesome, but i am in regret why i can't think like this

anyways, thanks a lot bhai, best wishes!!

mera toh TLE aagaya lmao

Bahoot tagda bhai . 🙏👏🔥

Hip hop bal explation thanks so much

Wow bro i really like the way you explain everything.

Aacha smjhayav guruji Frzi nhi nikle

Ram ram gurudev

Great Explanation !!! Keep up the good work !

bhaiya question theek se samaj me nahi aaya. Kab darasal ball stuck ho jata hai

🤠🤠🤠🤠 guru ji came back 👍

Nice explanation bro, thanks

I know that you are too busy in life But i like your style of teaching A daily video can help me and many more students. Please try if you can it helps so much I believe that you can grow easily in RU-vid.

my solution: static int getMinimumCost(int k, int[] flowers) { Array.Sort(flowers); Array.Reverse(flowers); int n_flowers = flowers.Length; int k_friends = k; int[] cost = new int[Math.Max(n_flowers, k_friends)]; int l = 0; cost[0] = 1; for(int i = 1; i < Math.Max(k_friends, n_flowers); ) { if (i / k_friends == l) { cost[i] = l + 1; i++; } if(i % k_friends == 0) { l++; } } cost[0] = flowers[0]; for (int i = 1; i < k_friends; i++) { cost[i] = flowers[i]; if (i == k_friends - 1) { int j = k_friends ; while (j < n_flowers) { cost[j] = cost[j] * flowers[j]; j++; } } } int sum=cost.Sum(); return sum;

Bhai whats the logic behind sorting the sum arrays, Please help

one of the greatest explanation bro

Really good solution

brother you just write the code and did not explain the only thing you explained was already explained in question itself no approach to the soloution alogorithm please make a descriptive video of how to come to looping and containers and type array and how to find the equality condition in the question

You can use Competitive companion extension to get all test cases in VS code.