Partition in K Subsets | Recursion & Backtracking | Code and Implementation

[@sharuk3545]

just one word for you sir legend .. your logic to solve the question is awesomeee

[@Pepcoding]

Thankyou beta for such kind words. Keep watching and keep learning😊

[@sharuk3545]

@@Pepcoding thnks sir i recommended your videos my senior as well as my junior

[@CobraAnkit]

Sir, you should analyze the code of the question.

[@vishwashdwivedi9469]

Great work Sir ... Appreciable work !

[@Pepcoding]

Thankyou beta! I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like our efforts, will you like to write a few words about us here - g.page/Pepcoding/review?rc

[@Sunny-qq6un]

thank you very very much sir, I have been stuck in this problem for 1 day, thanks a lot sir

[@Pepcoding]

Happy to help. For better experience and well organised content sign up on nados.io And for being updated follow us on Instagram instagram.com/pepcoding/

[@Now_I_am_all_fired_up]

Always :--- Love u Sir

[@_hulk748]

thankyou sir❤❤🙏🙏

[@nishthagoyal5018]

You explain in a very nice way👍

[@Pepcoding]

Thanks and welcome

[@kunalchandra9869]

Shakespeare of recursion😎!

[@Pepcoding]

Haha Keep learning, Keep growing and keep loving Pepcoding!😊

[@shubhamagarwal2998]

awesome details and explanation sir

[@Pepcoding]

Glad to know that you liked the content and thank you for appreciating. The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos. So, keep motivating, keep learning and keep loving Pepcoding😊

[@prateekbansal2014]

sir please har video me question ki time or space complexity bhi bta diya karoo ... ya fir description me daal diya karoo

[@sagarbhoi7873]

nice sir

[@ashutoshdixit2806]

listen properly at 14.01 ... it make clear everything

[@Pepcoding]

Thankyou buddy! If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )

[@mukultaneja7243]

Great explanation sir ! Please tell.... how can we prevent the calls with empty array, because it may take much extra time in higher n and k values.

[@Pepcoding]

break lgaya hai na, pehle empty set se.

[@mukultaneja7243]

@@Pepcoding oh okay sir got it ! Thankyou so much ❤️

[@varsha4260]

@@Pepcoding but sir ham yaha pe no of set==k check kar rahe hai na,so all those which have only k-1 elements or less than that we are making unecessary calls to it right!Is there any way to prevent making those extra calls?

[@ShaniKumar-ql2ow]

you are doing great work sir ! please make videos on dp also.

[@Pepcoding]

50 questions on DP just got done. Check this www.pepcoding.com/resources/online-java-foundation/dynamic-programming-and-greedy www.pepcoding.com/resources/data-structures-and-algorithms-in-java-levelup/dynamic-programming/

[@lovi1999]

Ekdum mast Sir.

[@Pepcoding]

It's my pleasure!! keep watching and share as much as you can

[@programmertik2046]

n=3 1 2 3 k=3 Sir code will fail to handle it wont print anything this test case Correct me if im wrong !!! Baki continue your GOD level teaching sir !!!!

[@Pepcoding]

Sorry, we won't be able to take your doubts here and assist you here. For better experience visit on nados.pepcoding.com

[@srijandasbiswas4864]

Sir ek bahut serious doubt hai ... Ye backtracking kaab jarurat hai ye samajne me thoda problem ho rhi , i mean normal recursion me bhi jab wapas aayega control toh bhi chize toh undo ho jaati hai na Like level1 pe wapas aaya control toh bhi normally level2 ke chize toh undo ho hi jayegi right??

[@Pepcoding]

Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.

[@ankitgupta-ph4nk]

Sir everything is fine here, here we are printing the list and removing, what if i want to return the whole list of k partition subset from this method.

[@harshtekriwal131]

Sir I tried this logic on leetcode but it exceeds time even after many optimizations, is there a better approach for this question?

[@tarushiarora6887]

exactly....can you tell name of this question in Leetcode?

[@vibhanshattri]

Do memoisation

[@aayushpagare9366]

PLEASE CAN YOU TELL QUESTION NAME AND NUMBER ?

[@hrithikpandey2656]

@@aayushpagare9366 698. Partition to K Equal Sum Subsets

[@mayur_madhwani03]

class Solution { public: bool ans = false; bool isValid(vector& sums){ int n = sums.size(); for(int i = 0 ; i < n - 1 ; i++){ if(sums[i] != sums[i+1])return false; } return true; } void solve(vector& a, int idx, vector& sums, int target){ if(ans == true)return; if(idx == a.size()){ if(isValid(sums))ans = true; return ; } for(int i = 0 ; i < sums.size() ; i++){ if(sums[i]>0 && sums[i] + a[idx]

[@nishitadash971]

Sir, what if the requirement for partition is contiguous? for example in the set [1,2,3] with k=2.... (13 | 2) cannot be one of the subsets. it can be only ( 12 | 3) or (1 | 23)...? how should I approach this sir?

[@punyaslokdutta4362]

Prefix Sum

[@AbhijeetSachdev]

nC(k-1)

[@utpalpodder-pk6vq]

sir can you please check this input [5,2,5,5,5] 3 its generating some duplicate sequence of outputs... i am facing this issue with leetcode :698. Partition to K Equal Sum Subsets

[@utpalpodder-pk6vq]

one way I thought i could restrict the processing of duplicate sequence by maintaining a global var which can keep track of the intermediate result ....but its seems not a memory efficient soln....if there any better way I could get rid of it please share it....

[@Pepcoding]

Gimme some time, I'll check it and beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.

[@Yash-uk8ib]

@@utpalpodder-pk6vq sir did u get it now?? plzz share with me!! struggling with the same

[@hymnish_you]

For those who are getting TLE. Sort the array in reverse.

[@programmertik2046]

how does this help can you explain ??

[@vaibhaves]

Can you do the egg drop problem? with which floors to drop the eggs from . thanks

[@Pepcoding]

Sure!

[@yogita868]

Sir please upload the solution of a magnet puzzle problem

[@011_tanyadixit4]

Thank you so much for your insightful explanations sir :) p.s. is this question on leetcode I can't find it

[@live_study_with_me]

similar problem is there leetcode 473. Matchsticks to Square

[@RahulKumar-od6zk]

Sir level 2 me aur videos kab aa rhe????

[@Pepcoding]

Jldi he resume krege beta, most probably by the end of this month.

[@RahulKumar-od6zk]

@@Pepcoding thank you so mush sir, Respect 3000

[@sakshamkumarsharma2309]

Hi sir should i do your 2500 list of questions of DSA or 500 list of questions of DSA. I am currently in my 2nd year. Please help sir i am really confused

[@Pepcoding]

500 wali

[@vinay8163]

2500 question ki list dena bhaai ?

[@garima6571]

Can u please provide the code in description in c++?

[@Pepcoding]

check it out on nados.io

[@_busybee23]

GOD

[@Pepcoding]

Glad to know that you liked the content and thank you for appreciating. The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos. So, keep motivating, keep learning and keep loving Pepcoding😊

[@Elon-musk-007]

How do we know that backtracking is needed or not needed;

[@Pepcoding]

beta jahan level aur options ki feel aaegi to backtracking lagegi. jahan options dikhne lagein

[@Elon-musk-007]

@@Pepcoding print sequences vaale question mein bhi to 2 options thi vaha backtracking kyon nhi lagayi

[@Pepcoding]

bilkul lga sakte the. level1 mei print sequence mei lgai hai.

[@rahulranjan7567]

@@Elon-musk-007 JIdhar bhi multiple calls lagti hai and jidhar bhi tumhari input ko reuse karne ka locha hota hai udhar Backtracking laga sakte hai. Idhar se hi DP nikalti hai with slight modifications. Bass yeh samjh lo ki agar problem overlap ho rahi hai toh backtracking lagg sakti hai

[@Elon-musk-007]

@@rahulranjan7567 Thanks bro

[@KAMALKAMAL-ig6qc]

Sir ek din mein 1-2 questions hi kyu daal rhe ho??

[@Pepcoding]

jaanke nahi yar. kuch income tax ka kaam aya hua hai. jyada karenge asap. at-least 10-12 per day.

[@RajatSingh-dg8ov]

Hi sir This code is giving tle on leetcode

[@Pepcoding]

Okay beta, lemme have a look

[@RajatSingh-dg8ov]

@@Pepcoding thank you sir, thanks for the prompt reply.

[@shubhamaggarwal3823]

sir , 720p daalo atleast plz.

[@Pepcoding]

ab theik ho gai hogi.

[@prahladrana6391]

sir , ye smjh nhi aaya ki pehli baar jb 1 add hua tb uske liye bhi do calls lagi thi. one where it is added into the existing set and the other where it creates its own set, sir 1 k liye kya hoga matlab nhi ayaa smjh..

[@prahladrana6391]

please guide me sir

[@Pepcoding]

nhi bro. ya to existing non-empty set mei add hona hai ya pehle empty set mei. 1 ko to sare sets empty he mile na.

[@prahladrana6391]

​@@Pepcoding​means 1 will never execute that if block.

[@ashutoshdixit2806]

****AaAgGg!!!!!!

[@Pepcoding]

🔥☄️😬🙊

[@AmandeepSingh-ot6st]

Bhaya ....c++ mai bhi code likh kar dikhaaya karo.... Ab...kuch bachcho ko java Puri nhi aati ....toh pehle java padhni hogi ...phir code ka flow samaj aayega....phir c++ padhne ka kya hi faayeda... Plzzz...Bhai...c++ mai bhi code likhar dikha diya karo......bahut pareshaani hoti hai...java ka code samajne mai...kyui ye ArrayList Sabhi c++ mai nhi hai...🙄

[@Pepcoding]

Iske pehle 5 lecture karlo. Basic Java 2-3 din mei aa jaegi. www.pepcoding.com/resources/online-java-foundation