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

In this video, I'll talk about how to solve 2035. Partition Array Into Two Arrays to Minimize Sum Difference | Meet in the Middle | Binary Search | Bit Manipulation | Dynamic Programming
But Manipulation Playlist - • Complete BIT MANIPULAT...
Checkout DSA-169 Series: • Aryan DSA-169 Series |...
100Days 100k Placements: • 100 Days 100K Placement
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
📱Telegram : t.me/aryan_mittal_group
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
0:00 - Problem Explanation
2:51 - Dynamic Programming
9:35 - Meet In the Middle (CSES Problem Set) - From Scratch
18:13 - Intuition
21:00 - Explanation + Dry Run + Code Explanation
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

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

[@crazy_shorts743]

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

[@priyanshkumariitd]

yes

[@tejasmundhe8773]

use map

[@priyanshkumariitd]

@@tejasmundhe8773 yes

[@user-sg2yb3vu9q]

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

[@codencode5546]

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

[@yashkumar9671]

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

[@divy04]

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

[@ADITYARAJ-yv2tr]

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

[@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

[@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 ?

[@anshitsrivastava5327]

great explanation

[@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.

[@ram_kumar609]

What a explainantion , Great Optimization. Really loved it

[@satwiktatikonda764]

waiting for this one so badly!!

[@gp7060]

Bestest explanation so far

[@harshkankariya4423]

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

[@chandrachurmukherjeejucse5816]

Great brother.

[@ritikshandilya7075]

Thanks for amazing explanation

[@ayushtandon1719]

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

[@wacky199]

Man!! Good explanation, keep it up.

[@top_g755]

Thank you brother 🙏

[@nikhilprakash729]

Understood Sir😊

[@vinamrasangal8436]

thanks a lot !!!! 😊😊

[@beginner9599]

You own it!!!❤

[@sarathkumardunga5240]

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

[@prakhargarg4166]

take more and more problems daily please

[@shrshawn]

mfking problem

[@donabiswas6266]

please make your vide short. i

[@ellagicham]

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

[@ashish3487]

first view

[@saikeerthanchiluka4027]

Question ko ithna complex Kartha is bandha

[@sakshammisra189]

bkc yeh kaisa question tha

[@arjunc1482]

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

[@sudiptakhotel1204]

great explanation