3218 & 3219. Minimum Cost for Cutting Cake II & I | Greedy | Sorting

In this video, I'll talk about how to solve Leetcode 3219. Minimum Cost for Cutting Cake II | 3218. Minimum Cost for Cutting Cake I | Greedy | Sorting
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@ARYANMITTAL]

Do you guys want for Problem 1 & 2 also? do let me know❤

[@RajatGore-bl6lv]

Thank you , 1 & 2 already done

[@TON-108]

1st one is too easy, you can go with 2nd (this is also basic linked list problem but still)

[@sanasainath7758]

No

[@tushar404]

Naa, Too easy Maybe for 2nd if possible without using set??

[@mohammedaltaf4316]

No 1 and 2nd done too easy

[@subhankarkanrar9494]

Very good explanation Aryan ☺️

[@arjunreddynarala]

Amazing logic bro , love your consistency❤

[@vishalmishra1937]

superb explanatiion. i stuck on intuition on new problems . any suggestion u can give i can work upon it.

[@10minutes_cs]

4:31 mac cam is funny sometimes ..

[@ARYANMITTAL]

Truee 😂

[@harshalgarg1676]

thanks bro

[@rishantrana3953]

Can you also try to cover Atcoder contest?

[@AzeemKhan-sn3yi]

luv u bhai!!

[@nptel1punith929]

is it m*n cuts required?

[@immrhrr]

Use count sort instead of inbuilt sort in cpp to get it done in o(n) instead of nlogn 😅

[@immrhrr]

Because range is given from 1 to 1000 only😅

[@anubhavgupta5184]

can you prove your solution ?

[@AJK-a2j00k4]

bro it's greedy solution, you can't prove it.. just intuition!

[@anubhavgupta5184]

@@AJK-a2j00k4 How did you prove the correctness of your greedy solution ? :)

[@AJK-a2j00k4]

@@anubhavgupta5184 maybe make some testcases and try it out.. I am not a pro so fully not sure :)

[@shashankmaurya-w7d]

long long minimumCost(int m, int n, vector& h, vector& v) { long long res = 0, hcut = 1, vcut = 1; sort(h.rbegin(), h.rend()); sort(v.rbegin(), v.rend()); int i = h.size() - 1, j = v.size() - 1; while(i >= 0 && j >= 0){ if(h[i] > v[j]){ res += (h[i]*vcut); hcut++; i--; }else{ res += (v[j] * hcut); vcut++; j--; } } while(i >= 0){ res += (h[i]*vcut); i--; } while(j >= 0){ res += (v[j] * hcut); j--; } return res; } can someone find the bug in my code.

[@pankajsingh6451]

i think you are sorting in descending order bro , modify it to:- sort(h.begin(), h.end()); sort(v.begin(), v.end()); good luck

[@rtadwq...------...----.]

Why the condition is "if (h[i] > v[i])" Not "if (vcut*h[i] > hcut*v[i])"

[@aditya205]

thanks bro