DP 54. Partition Array for Maximum Sum | Front Partition 🔥

[@nagatanujabathena6319]

Just an update : The problem link in the description points to a different question.
Thanks a lot for providing such a valuable content for free!

[@rupamhari115]

You taught the entire DP series so well.. that I solved both front partition problems by my own from Recursion to Tabulation, and then I am seeing this video to increase views count and also to know your approach.
Thank you so much bhaiyaa ❤❤❤❤

[@PiyushSharma-ud9qk]

Same bhai same😌😌

[@rupamhari115]

@@PiyushSharma-ud9qk 😀😀

[@gandhijainamgunvantkumar6783]

I was going to directly watch the video, but when I saw your comment I stopped the video and tried the problem by myself and I solved it in the first attempt only without any wrong answer. Thanks for motivating me to try by myself 😄😄😄

[@rupamhari115]

@@gandhijainamgunvantkumar6783 great.. ❤️😎

[@gandhijainamgunvantkumar6783]

@VIVEK YADAV amazing 🔥

[@yashkhatwani3198]

Understood and completed the entire series. This is the best series till now. Love you keep contributing for community

[@sarthaksharma6973]

Solved this problem Completely on my own thanks a ton for this series. Wished this series came much earlier I won't have to struggle in dp a lot. Kudos to content creators like Kartik arora and striver.

[@sarthaksharma1761]

Nice name Homeboy

[@Anonymous____________A721]

This is one of the simplest dp qns

[@stith_pragya]

I too solved this problem on my own but checking the video to increase view count + to know Striver Bhaiya's code........This A2Z Sheet is just amazing........words are not sufficient to justify its appreciation.................Thanks a ton Striver Bhaiya.........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@AniRec-e8u]

solved this problem completely on my own thanks to your series it took me some time getting the partition and sequencing question but once i got it , it was amazingly easy.

[@Noob_Coder1234]

JUST ONE MONTH BACK FRO TODAY THIS QUESTION WAS ASKED IN LEETCODE'S DAILY QUESTION AND I LEAVE IT BECOZ I DID'NT EVEN KNOW WHAT THE DP IS FROM NOW I SOLVE THIS QUESTION WITHOUT WATCHING SOLUTION IN RECURSIVE + MEMOZIATION + TABULATION METHOD JUST BECAUSE OF THIS GOAT MAN AND TEACHER STRIVER♥

[@stith_pragya]

UNDERSTOOD.............Thank You So Much for this wonderful video............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@anujrathore5726]

did that que by myself , thankyou striver for this gold dp series .

[@codingProfile449]

was able to solve this problem on my own. Thanks striver for teaching the entire dp series so well.

[@raunakagarwal8284]

was able to solve this question on my own . Thankyou Striver

[@tasneemayham974]

To the world you are a teacher. TO YOUR STUDENTS YOU ARE A STARRR!!!!
UR the best bro!

[@simarpreetsingh7235]

Legendary Playlist, Thank you so much!

[@sameersahu4569]

Wrote the code all by myself..all thanks to you
Understod!!

[@UECAshutoshKumar]

Thank you
Understood!!!

[@dudeyouhavenoidea]

Awesome solution and great explanation

[@ritikshandilya7075]

Thankyou for amazing solution Striver

[@allaboinadivakar1976]

understood very clearly thank you striver.

[@mriduljain6809]

Was able to solve the problem on my own.
All thanks to you Bhaiya.. You have made DP very simple
As always "understood"

[@sharmilasiram5438]

Solved this on my own! thank you so much

[@shivamtiwari20028]

Solved this problem on my own
Thankyou so much striver ❤

[@ntgrn-pr5yx]

thank you understood , striver

[@DevashishJose]

Understood, Thank you so much Striver.

[@Hrushi_2000]

This is kind of Tricky. Thankyou Sir. Understood.

[@amanbhadani8840]

Your explanation on topic like front partitions makes this concept super duper easy to understand.

[@scripter7676]

Thank you striver just because of you today i am in codenation as an SDE 5

[@pawanagrawal7653]

bhaiya referral dede na..

[@dennyage4791]

Thanks you sooo much sir for teaching us this awsome dp series, i can say this dp playlist is best ever in internet .

[@ThePurist141]

Hello, thank you so much sir for the wonderful explanation of this problem, and this is the first time I'm visiting your channel and this being the first video I've watched. Immensely helpful in understanding the working of the logic and the code.
Thanks a lot

[@KeigoEdits]

Did on my own! ❣

[@VivekVerma-oo3dx]

i dont know what to say
i am so dumb in dsa and making the dp problem by my own feels so great bhaia ..

[@prabhakaran5542]

Understood❤❤❤

[@hackytech7494]

How can you explain this problem so easily ♥Thanks a lot.

[@parasgupta1391]

Kya explaination the waaaaaaaaaah!!!!!!!!!1

[@cinime]

Understood! Sooo amazing as always, thank you very much!!

[@sukhpreetsingh5200]

Awesome series

[@RohitKumar-dy2gc]

hurray! i solved this ques by myself 😊

[@akashpal7748]

understood😀

[@crazyduniya128]

you can also get the length as j - ind + 1

[@PriyanshuKumar-wu4wk]

how do we know when we have to use front partitioning?

[@arihantjammar8888]

Understood 😊

[@surajjoshi3433]

What will be the time complexity of recursive approach?

[@jaividyasagarr7110]

Solved this problem on my own, Very grateful to you Striver
Here's my Tabulation approach,
class Solution {
public:
int maxSumAfterPartitioning(vector& arr, int k) {
int n = arr.size();
vector dp(n+1, 0);
for (int i=n-1; i>=0; i--) {
int ans = INT_MIN;
int maxy = INT_MIN;
for (int j=i; j

[@sparshbarolia1556]

[@ratinderpalsingh5909]

Understood, sir. Thank you very much.

[@verma_jay]

understood

[@premduvvapu476]

Understood

[@mohitaggarwal6220]

I have a doubt in 2 questions, like in MCM question we take dp as f(i, j) --> consider what will be the answer if array is from (i to j) and here we just reduces our time complexity, and make the problem into f(i) --> what will be the answer if array starts from ith index. so can we reduce MCM problem into front partitioning problem ? If not then why?? what is the main restriction for which we can't do that problem in front partitioning manner?

[@adebisisheriff159]

Understood!!!

[@dhanashreegodase4445]

what will be the TC of recursive solution without memoization?

[@ujjalsaha428]

As always "understood" ❤️

[@Hemus212]

understood, very well explained

[@ueditz6807]

Problem link given ..is not correct 🙂

[@Truysジャ]

Do u know the correct problem link, can u pls share if u have.

[@coding8000]

yes, its wrong, please send the correct one.

[@vaibhavkumar526]

Here you go: leetcode.com/problems/partition-array-for-maximum-sum/

[@kunalrastogi6530]

can we apply greedy?

[@mohammedsuhail8706]

Isn't this unbounded knapsack?

[@soubhikghosh6564]

Bhai this man is a god of DSA literally!

[@adityasaxena6971]

Understood Striver , Thanks a lot

[@bakyt_yrysov]

Thank you so much!!

[@rishabhgupta9846]

Understood,able to solve by myself

[@rameshpokhriyalnishank7445]

As always "understood" ❤

[@vaibhavkumar526]

Problem link: leetcode.com/problems/partition-array-for-maximum-sum/

[@harshdasila6680]

Aayee Aapka Tha Humen Intezar

[@AmitRanjan-xt2th]

@Striver Bhaiya - Why not -1 to answer as like previous Question i.e Palindrome Partioning-2 ,here also we going to last element

[@UtkarshSharma-f1c]

Great video

[@awkward_adi]

Can anyone Explain how to differentiate between front partition and mcm type problems?

[@ganeshkamath89]

Thanks Striver. Understood.

[@Harshit126]

Understood, thanks

[@mihirsaini592]

THANK YOU SIR.

[@parshchoradia9909]

Understood SIr!

[@shivanshusingh5391]

Thanks a lot

[@faizansiddiqui753]

Can someone answer this question Why can front partition logic cannot be applied in minimum cost to cut stick, burst balloons, evaluate boolean expression??

[@amitrawat8879]

Bhaiya why we used ind+k because isse toh range badhti chli jayegi hrr iteration mai, toh wo 3 elements ko he kese select karega. (For k = 3)

[@amitrawat8879]

Bhaiya why we used ind+k because isse toh range badhti chli jayegi hrr iteration mai, toh wo 3 elements ko he kese select karega. (For k = 3).

[@nehapol9862]

Best explanation ever

[@sayandey1131]

How to know when to go for Front partition and when to go for normal partition DP like MCM?? ...I am having a bit of difficulty in understanding this.

[@akashsahu2571]

yes

[@vikneshcs4824]

Would the number of partitons exceed k here

[@rishupatel7285]

Tried to solve it differently be declaring a 3D DP although it gave TLE at40/52 TC.

[@gsampath8017]

Thanks striver❣️

[@vibhujain4134]

Understoooooooooooooooooooooooooooooooooooooooooodddddddddd!!!!!!!!!!!

[@YashveerGahlot-t6b]

"understood"

[@yeswanthh5068]

Understood 🙂🙂💚

[@dharsan.s7937]

is dp playlist completed ?

[@mohdkhaleeq7468]

understood bro great explanation

[@satyampande684]

understood!!
Codestudio Problem Link - www.codingninjas.com/codestudio/problems/maximum-subarray_3755255

[@suhaanbhandary4009]

understood!!

[@gangsta_coder_12]

UNDERSTOOD

[@rohalkurup1350]

Understood !!!!!!!!!!!!!!!!!!!!!!!!

[@U2011-n7w]

why space optimization is not working here

[@vishious14]

Because we’ll need atmost “k” independent arrays and not two. That being said, we can optimize this using “k” number of arrays.

[@blitzkrieg7453]

@@vishious14 actually dont we just need k number of variables to space optimise instead of arrays as you mentioned!

[@samyakjain7422]

understood!!!!!!!

[@Ashwani_sharma]

Can anybody please tell me how to shift all selected lines(shortcut) as done at 20:22

[@tusharrustagi5729]

understood

[@VikashYadav-px8ei]

Understood 🎉

[@avisoft-l2p]

US bhaiyaa

[@iamnoob7593]

US striver

[@aakashrockster8576]

I solved this on my own

[@ankushroy5606]

can't we apply greedy like which element is maximum give him maximum space left

[@altamashsabri8142]

No......take example:- [ 1 15 13 4 4 1 ] k=3
By greedy we would want to give 15 , space of 3 means [ 15 15 15 4 4 4 ] sum=57
But [ 15 15 13 13 13 1 ] sum= 70 which is maximum you can get

[@aditithakur6226]

Understood Sir.

[@RimoGhosh-p5b]

Why aren't we using 2D dp for this problem? Can Anyone plz explain.

[@krat9707]

cuz we only need the max of the 3 partition we do so storing only that maximum is useful

[@ashwanisharma8903]

understood. Super

[@pranayreddy5824]

If anyone have problem link please share

[@giraffe4375]

Thanks striver