Split Array Largest Sum | Leetcode 410. Daily Challenge | Binary Search Hard Interview Problem

Join this channel to get access to perks:
/ @probabilitycodingisfu...
Connect with me on LinkedIn : / alisha-parveen-80579850
Check out our other playlists:
Dynamic Programming:
• Dynamic Programming
Trees:
• Trees
Heaps and Maps:
• Heaps and Maps
Arrays and Maths:
• Arrays and Maths
Bit Manipulation:
• Bit Manipulation
Greedy Algorithms:
• Greedy Algorithms
Sorting and Searching:
• Sorting and Searching
Strings:
• Strings
Linked Lists:
• Linked Lists
Stack and Queues:
• Stacks and Queues
Two Pointers:
• Two pointers
Graphs, BFS, DFS:
• Graphs, DFS, BFS
Backtracking:
• Backtracking
Non- DSA playlists:
Probability:
• Probability
SQL-Basic Join functions:
• SQL - Basic JOIN Funct...
SQL-Basic Aggregate functions:
• SQL-Basic Aggregate Fu...

[@probabilitycodingisfunis1]

int low = *max_element(nums.begin(),nums.end()); // 8 int high = accumulate(nums.begin(),nums.end(),0); // 23 int ans = low; while(lowm) low = mid+1; else { ans = mid; //minimize ans high = mid-1; } } return ans; } int no_of_subarrays_with_max_sum_as_mid(vector&nums, int mid) { int sum =0; int count = 1; for(int i=0;imid) { sum = nums[i]; count++; } else sum+=nums[i]; } return count; }

[@dhananjoydey1337]

can you please upload solution of today's POTD?

[@bharathkumar5870]

hi,can you please reply why this is failing.I have just made one simple change ,i have written "=" case and "

[@informative180]

the effort you put in explanation is awesome and exceptional. keep making such videos. thanku so much .

[@RohanSaluja]

I woke up in the morning and the first thing I saw was this question. And so, I went to bed again🙇🏻‍♂️🙅🏻‍♂️

[@foodcourt6810]

🤣

[@vidhanshuborade5977]

😂😂 legend

[@AbhimanyuSingh-vg9cl]

You explained better than my relevel(unacedemy) teacher.Thanks.My confusion resolved.

[@trickydirector2584]

Amazing explanation! Thank you so much!

[@rogelio_camargo]

This has to be the best explaination for this problem on this platform, thank you!

[@istiaqhossain3340]

thanks a lot.. i have watch many video. in every other video some how they get complicated in explaining how to select the low value... here its really cleared a lot...

[@sarankumar165]

brilliant problem and great explanation, LC :( That's how you gonna end an awesome March man!!

[@probabilitycodingisfunis1]

Thank you, yes it's an amazing problem 🤩

[@VedBrahmbhattBEE]

very well explained! Thanks for the approach and intuition .

[@aryankhairwal]

You solved it So Effortlessly, Nice Explanation. Thank you ❤️

[@explained737]

Awesome explanation mam❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤

[@manasvipathak391]

Thankyou. Makes understanding very clear.

[@shudhanshukumar178]

well explained !!!

[@asifbasheerkhan2855]

I never thought that in this question we can use Binary Search. Good explanation...

[@arjunpunni4221]

Your insights are just as beautiful as you are 😉, and I think that's really amazing. Keep shining!🤞

[@navoditatandon5476]

Amazing. Thank you !!!

[@danussh]

perfect😁😅 Thanks for approach

[@nikhilsoni8840]

Thnx a lot didi you explained it in the best way....after getting disappointed from 2 BIG youtubers. Finally the topic is cleared here Thanks ❤

[@purnamritab]

Superb explanation, thank you so much.

[@ekengineer9868]

Nice explanation didi

[@unknown47896]

superb explanation...literally the best explanation for this problem on yt

[@krishvibes1506]

Wow! Great explanation!

[@HetNotFound]

very well explained...tnx ma'am😊

[@happyyaar3157]

Your explanation is just amazing

[@manoharank9171]

Well explained 🎉

[@muditkhanna8164]

this question is exactly same to book allocation and painter's partition.

[@harshprajapati2729]

Thanks for the video

[@meetpatil8531]

nice explanation didi.....💯

[@namanshah8523]

very well explained ma'am

[@aaviff1810]

Thank u mam The way u explained is next level❤️ U deserve more subs🙏

[@pranavkhatri30]

great explanation bhai!!

[@piyushagrawal3709]

How much time should I give to one question and after how much time I should see the solution

[@sarcasticLordzz]

god level explaination mam

[@ushapandey1088]

Thanku its today gfg potd

[@jithuboi]

Thank you.

[@litegamertech1723]

Awesome explanation 🔥

[@probabilitycodingisfunis1]

Thank you 🙌

[@Idukhan-jj9kc]

💯💯

[@rahulbhandari3558]

Best explanation 💯

[@probabilitycodingisfunis1]

Glad it helped

[@rohan7071]

Oh thank goddddd for this!!! 🤕

[@Bavasharan]

Is the mid value is calculated using indices but here with direct values can anyone explain

[@raghavgoyal9153]

Thanku very much.

[@bharathkumar5870]

this question is same as books allocation problem....

[@anushkathakur6531]

wow

[@meandpenguinvlogs8221]

💯

[@me10amaanakhtar55]

Y star kyo lagaya gaya h please explain this

[@meandpenguinvlogs8221]

👍👍👍👍

[@dhananjoydey1337]

Niceeeeee

[@AmarjeetKumar-to9ub]

🔥++

[@dhruvgoel25]

Very nice explanation 👏

[@probabilitycodingisfunis1]

Thank you so much ❤️

[@Rajat_maurya]

Not uploading videos?

[@vd5875]

Can you tell me the error, not getting proper output int isPossible(long long int a[], long long int n, long long int k, long long int mid) { int arrayCount = 1; long long int sum = 0; for(int i = 0; i < n; i++) { if(sum + a[i]

[@karma7917]

U r extremely cute😳

[@ritwikchawla9000]

Woh mujhe apse doubt puchne hai toh app apna number de sakti ho !

[@prakashmohaldar9004]

Pro comder ko mera pranam😏