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

[@himanshubabbar7403]

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!!

[@Entertainment_for_kida]

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

[@priyanshkumar17]

yes

[@tejasmundhe8773]

use map

[@priyanshkumar17]

@@tejasmundhe8773 yes

[@tsunithkumar8801]

How to do it ​@@tejasmundhe8773

[@codencode5546]

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

[@thespecialthing9067]

First video watched by him, and totally impressed by the explanation.

[@yashkumar9671]

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

[@raisanjeeb42]

Beautifully Explained bhaiya !
Thanks,

[@PrakulKhurana-sb1dw]

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

[@divy04]

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

[@yaminireddy3321]

very well explained.. Thankyou

[@ayushtandon1719]

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

[@nikhilprakash729]

Understood Sir😊

[@ram_kumar609]

What a explainantion , Great Optimization. Really loved it

[@tsharmi919]

wow🔥🔥

[@gp7060]

Bestest explanation so far

[@ZimboiZana]

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

[@chandrachurmukherjeejucse5816]

Great brother.

[@sripatisuryateja1850]

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.

[@satwiktatikonda764]

waiting for this one so badly!!

[@wacky199]

Man!! Good explanation, keep it up.

[@top_g755]

Thank you brother 🙏

[@harshkankariya4423]

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

[@ritikshandilya7075]

Thanks for amazing explanation

[@ADITYARAJ-yv2tr]

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

[@asthajain2511]

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 ?

[@beginner9599]

You own it!!!❤

[@sudiptakhotel1204]

great explanation

[@sarathkumardunga5240]

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

[@vinamrasangal8436]

thanks a lot !!!! 😊😊

[@samadsiddiqui3956]

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.

[@ashish3487]

first view

[@prakhargarg4166]

take more and more problems daily please

[@ellagicham]

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

[@donabiswas6266]

please make your vide short. i

[@sakshammisra189]

bkc yeh kaisa question tha

[@shrshawn]

mfking problem

[@anantpawar782]

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.

[@KeigoEdits]

Striver did the problem with different contraints, dp solution isn't applicable for this problem.

[@siddhantgupta4802]

Time waste

[@saikeerthanchiluka4027]

Question ko ithna complex Kartha is bandha

[@pragyaditya9208]

maksad🤣😆

[@arjunc1482]

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

[@anshitsrivastava5327]

great explanation