/***** //Q.You need to find the maximum sum of a subarray (containing at least one element) in the array arr[]. Note : A subarray is a continuous part of an arra Kadane's Algorithm is a dynamic ...

The test cases don't include the case of more than one only-zeros array. My code works for all the given test cases but fails the case when it's an array of more than one only-zeros e.g. [0, 0, 0].