Q. Given a one-dimensional array of integers, you have to find a sub-array with maximum sum. This is the maximum sub-array sum problem. Which of these methods can be used to solve the problem?

• Dynamic programming
• Two for loops (naive method)
• Divide and conquer
• Dynamic programming, naïve method and Divide and conquer methods

Submit