Idea for solving this question is first calculate the sum of array them apply subsetSum for array_sum/2 if it exist then return true else false, also check if array sum is odd then return false because no 2 subsets with equal sum can give an odd value upon their sum. Came up with the solution myself Thanks Luv bhaiya
Broo you are the best. I followed your DP series and now I am able to understand and solve the problems easily. You not only teach us the method, you also teach us how to think. Keep up the amazing work ❤
bhaiya mera ek doubt hai , aap please help kardo , mujhe ek dun achese yeh recursive fxn + memoize samjh aagya but isko tabulationse kaise soche bottom - up approach kaise lagaye uska please ek lecture bana dijiye PLEASE
Hey bro can you please tell how to approach Google from tier 3 colleges? Please tell how you approach (which college were you in) basically whole story
They way i approached partitioning was to keep 2 auxiliary vectors and in each recursive call(at each index) i'll have the choice to put that element in one of those two array and when all indices are done the partition would have been completed. So at the base case i can compare the sum of elements of those two partitions(vectors). Me at 7:00 : Yeah i did a great job brute-forcing the solution to the height of stupidity 🥲
The dedication!!
He was literally making this for us at 4.30 AM.
Thank you so much :)
Bhaiya plz don't stop this course .It is really helping . I'm totally dependent on this coursr and you for the cp
Keep it going it is the best
Idea for solving this question is first calculate the sum of array them apply subsetSum for array_sum/2 if it exist then return true else false, also check if array sum is odd then return false because no 2 subsets with equal sum can give an odd value upon their sum.
Came up with the solution myself
Thanks Luv bhaiya
💛best dp playlist that ever exists
bhaiya bhot sahi explanation thi....Keep it up👌
PS.: Bloopers bhi daal diya karo,entertainment bhi ho jata hai😂
Broo you are the best. I followed your DP series and now I am able to understand and solve the problems easily. You not only teach us the method, you also teach us how to think. Keep up the amazing work ❤
Bhai heaps aur avl trees kaha se kare?
GATEHUB
ABDUL BARI
You are a brilliant teacher. I feel this course is better than paid ones.
You are doing great work bro 💖
My first Approach in my mind is Just find the subset sums substract from total sums from array if both equal then return true otherwise return false.
bhaiya mera ek doubt hai , aap please help kardo , mujhe ek dun achese yeh recursive fxn + memoize samjh aagya but isko tabulationse kaise soche bottom - up approach kaise lagaye uska please ek lecture bana dijiye PLEASE
Best of best luv bhai!!💛
best DP lessons ever
Bruh keep uploading like this your content is just awesome 🔥
bhai , Luv new videos kab aayegi ....Aapne bola tha system design related content ayega ...but , Kab ?
Hey bro can you please tell how to approach Google from tier 3 colleges? Please tell how you approach (which college were you in) basically whole story
IIIT Allahabad
I wanted to know why you always some extra range for a given input ,like for a[i]
Thanx bhaiya
Luv u luv bhaiya 💗
God Teacher !
Thanku so much for the video
💛
Bhaiya 800 questions aur🌝
the amazing luv
Just
sum total ka half krdenge bhaiya
💛💛💛💛
17-aug 2022
Dynamic programming Kahan use hoi?
💛💛💛💛💛💛💛
half of the total sum we have to find only
💛💛🔥🔥
❤️💕💕❤️
Roasting Aditya Verma 😂😂
Sir, can you pls see your discord server's condition.
🧡💛
💛💛💛🙏
Second comment
💛💛💚💚
They way i approached partitioning was to keep 2 auxiliary vectors and in each recursive call(at each index) i'll have the choice to put that element in one of those two array and when all indices are done the partition would have been completed. So at the base case i can compare the sum of elements of those two partitions(vectors).
Me at 7:00 : Yeah i did a great job brute-forcing the solution to the height of stupidity 🥲
💛
💛💛💛💛💛💛💛
💕❤️
💛💛💛💛💛
Third comment
💛💛💛
💛
💛
💛
💛
💛
💛
💛
💛
💛
💛
💛
💛
💛
💛
💛
💛💛💛
💛💛
💛
💛
💛
💛
💛
💛
💛
💛
💛💛
💛
💛💛💛
💛💛
❤️
💛💛💛💛💛
💛💛💛💛💛💛💛