Closed Solanki-dharmesh closed 9 months ago
This is famous kadane's algo for solve problems like : Given an array arr[] of size N. The task is to find the sum of the contiguous subarray within a arr[] with the largest sum.
the concept of this algo is very useful in compititive coding.
This is famous kadane's algo for solve problems like : Given an array arr[] of size N. The task is to find the sum of the contiguous subarray within a arr[] with the largest sum.
the concept of this algo is very useful in compititive coding.