Meet in the Middle | 2035. Partition Array Into Two Arrays to Minimize Sum Difference | Day 022 

was stuck on this problem for 5 hours, didn't know how to optimise it further. Came across this video and Man!!! what an explaination. HATS OFF!!

dp solution will works if array has only positive elements . but if array has negative numbers . and if we get the total sum is negative then in dp vector creation problem will occur because of this negative total sum and compailer will shows heap-buffer-overflow

Beautifully Explained bhaiya ! Thanks,

Bhaiya I knew that binary search have to be used but ...to form the equation and utilize it to find the remaining elements .....how to build intuition for such problems ?

i'm at 15:00 and i feel really interesting problem and explanation is crazy as always. ❤

how dp will work partition arrays must always of size n, but we are saying can we generate a given target from subsequence but that may or may not be size n

16:45 maqsad mentionedddd.......mat bhoolna

man , what an effort and what an explanation, amazing, first time watched your video and subscribed

I think this dp solution will only work if array has all positive or all negative values , and also in this question there is a constaint that we can choose only N/2 elements, which also not fulfilled in the dp solution.

I don't actually comment on videos but after seeing your explanation, I had to!! Amazing explanation bhaiya, your channel deserves more subs and more views!! I really hope you will rock in the future.

What a explainantion , Great Optimization. Really loved it

Amazing Explanation Bro....!! Keep it up 👏

Really great work you are doing bro , very good and deep explainantion 💥💥

in the for loop(sz=1;....) it would be sz

Man!! Good explanation, keep it up.

at 6:48 bro remembered his maksad....

Understood Sir😊

Bestest explanation so far

Thanks for amazing explanation

Thank you brother 🙏

You own it!!!❤

great explanation

Great explanation. I guess the time complexity should be 2^n* nlogn

waiting for this one so badly!!

thanks a lot !!!! 😊😊

Great brother.

first view

take more and more problems daily please

It took some time for me to realise part 1 is not the left

please make your vide short. i

mfking problem

bkc yeh kaisa question tha

Hats off to your Efforts but Very Worst Explanation... Ek hi cheez jo striver ne explain nhi ki usme hi problem ho rahi hai.. Whole dsa on youtube is worst ever except striver.

Question ko ithna complex Kartha is bandha

I watched this a unhealthy amount of times and finally understood🥲🥲

great explanation