7
Kadane’s Algorithm | SDE Sheet | Arrays
source link: https://www.geeksforgeeks.org/videos/kadanes-algorithm-9uocaa/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Kadane’s Algorithm
Kadane’s Algorithm | SDE Sheet | Arrays
Video Player is loading.
Loaded: 0%
Remaining Time -0:00
- 460 Views
- 14/04/2022
In this video we will learn how to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum. We will be using Kadane’s Algorithm to solve the problem in hand.
Example: Input: [-2, -3, 4, -1, -1, 1, 5, -3] Output: Maximum contiguous array sum is 7 4 + (-1) + (-2) + 1 + 5 = 7
Check out the video to see how we implement this!!
Practice Problem: https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1 Article: https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/ SDE Sheet: https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK