Beginner
1. Arithmetic Progression2. Geometric Progression3. Harmonic Progression4. No of triangles 5. Area of Polygon6. Trailing Zeros7. Min Platforms 8. Trapping Rain 9. Jump numbers10. Segregation of 0’s and 1’s11. Two SUM12. Triplet sum 13. Diagonal Sum14. Addition of two matrixes15. Subtraction of two matrixes16. Multiplication of two matrixes17. Transpose of given array18. Spiral Matrix19. Most Frequent Element20. Majority Element 21. Max difference 22. Odd occurring23. Second Largest and Second Smallest24. Next greater number25. Count Unique Elements26. Common elements 27. Removing Duplicates28. Balanced Array29. Rotating Array by k times30. Reverse Array31. Wave Array32. Merge arrays 33. Constraint Sort34. Find element in Sorted rotated array35. Sub Array Sum36. Largest subarray of 0’s and 1’s 37. K-Sub Array38. Max subarray sum39. Contiguous Square SumMax subarray sum
LEVEL:Beginner
Description
Given an array of integers consists of positive and negative numbers. You have to find subarray with maximum sum.
Input Format
First line contains the size of the first array. Next line contains the m integers separated by the spaces.
Output Format
Print maximun Subarray sum.
8 2 6 -4 -7 3 -2 10 -1
11
5 -4 6 2 -1 7
14
6 3 2 -7 -1 4 6
10
Login to see Discussion
Approach
Approach1: Brute Force
Step-i) Initialize a 2 dimensional matrix of size n*n array size.
Step-ii) Iterate a loop i from 0 to n.
Step-iii) Initialize a[i][i]=0.
Step-iv) Iterate other loop j from i+1 to n.
Step-v) Assign a[i][j] with sum of a[i-1][j] and a[j].
Step-vi) So now the sum’s of sub arrays are stored In the matrix.
Step-vii) Iterate through every element of the matrix and store the maximum value.
Step-viii) Return the maximum value.
Time complexity: O(n^2)
Space Complexity: O(n^2)
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution