Finding Maximum Sum SubArray using Divide and Conquer Approach.
Algorithms Playlist: • Algorithms with Practice Problem
Placement Preparation Playlist: • Placement Preparation Playlist
Competitive Programming Playlist: • Competitive Programming Playlist
Graph Theory Playlist: • Graph Theory Complete
Subscribe for more DSA videos!
**Resources for Competitive Programming/Coding Interviews:
Competitive Programming Course:https://tinyurl.com/BibleOfCP
DS Algo Course:https://tinyurl.com/AbdulBariDSA
DS Algo and Coding Interview Course:https://tinyurl.com/DSACodingInterview
Dynamic Programming:https://tinyurl.com/DynamicProgrammin...
Competitive Programming Essentials:https://tinyurl.com/CPEssential
**
Edit: I made a mistake for the subarray on the left [-2,-5,6,-2]: The LSS=-2 RSS=6 and CSS=1.
For CSS{ mid+1=6 ,to the right max=6},{mid=-5 ,on the left max=-5} so CSS=(6-5)=1 Not -1.
See the code for more idea of CSS: • LeetCode 53 Maximum Subarray using D...
In this video I am going to show how to use divide and conquer to find the maximum value of sum of a contiguous subarray.
For the Code: • LeetCode 53 Maximum Subarray using D...