Kadane's Algorithm || Flipkart Series Part -2 || DSA || GFG || Coding
Kadane's Algorithm || Flipkart Series Part -2 || DSA || GFG || Coding
Question:-
Given an array Arr[] of N integers. Find the contiguous sub-array(containing at least one number) which has the maximum sum and return its sum.
Example 1:
Input:
N = 5
Arr[] = {1,2,3,-2,5}
Output:
9
Explanation:
Max subarray sum is 9
of elements (1, 2, 3, -2, 5) which
is a contiguous subarray.
Question link:- https://www.geeksforgeeks.org/problem...
Follow Me On Social Media
Facebook:- / mdsaifraza.raza.526
LinkedIn:- linkedin.com/in/md-saif-raza-99941523a
Twitter:- / mdsaifr10053951
Instagram:- / saif_raza8544