Kadane algorithm which is used to solve questions of arrays and strings.This algorithm makes the coder to understand the code easily and efficiently if a in a question it has been asked that find the maximum subarray sum containing positive,negative and zero integers then we can use this algorithm. To solve the question mention above using this algorithm the following steps are step 1 make variables like sum to store currsum and maxi to store maximum sum we need.step 2 using loop to iterate through the length of the array and adding the integers and storing it in sum variable then comparing this sum with the maximum sum that is maxi if currsum is greater than the maximum sum that is sum>maxi then sum will become sum=maxi since the array contain negative numbers also for this if the currsum come negative then update the currsum to zero sum=0 and this whole process will be repeated until it gets maximum sum.