Partition array to K subsets | Problem of the Day : 16/07/2022 | Siddharth Hazra

📝 Submit your solution here: practice.geeks...
Free resources that can never be matched, presented to all our Geeks for free! Subscribe now and start practicing today: / geeksforgeekspractice
Daily solutions are also uploaded exclusively on our channel! So start solving today and subscribe to our channel for the free coding lessons.
Solve the Problem of the day and test yourself: practice.geeks...
Getting bored just watching? Start practicing on your own: practice.geeks...
-----------------------------------------------------------------------------------------
Follow us and stay updated on everything happening in the world of geeks:
📱 Twitter- / geeksforgeeks
📝 LinkedIn- / geeksforgeeks
🌐 Facebook- / geeksforgeeks.org
📷 Instagram- www.instagram....
#GFGPractice #GeeksforGeeks #PracticeProblems #CodingQuestions

[@siddhartha166]

Hey Everyone.Hope u liked the video. Let me know if there is any scope for improvement

[@nishanghosh3948]

Thanks for the explanation! Was very helpful.

[@sal2054]

After reaching a csum==sum, how will the rec function is going to partition it into K subsets.Clarify this part please.

[@SayanMuhuri]

As you can see in the 19th line. We made a partion there only if the curr partition sum is total sum of array/k. In next step we will iterate through the array again to find is there is any number that is not previously used and can help us to make another partion. When the partition will reach its limit it will return true.

[@anupam_ghosh_]

didn't understood the code properly

[@SonuSingh-qw2bs]

like what??