• Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard
CSEstack

What do you want to Learn Today?

  • Programming
    • Tutorial- C/C++
    • Tutorial- Django
    • Tutorial- Git
    • Tutorial- HTML & CSS
    • Tutorial- Java
    • Tutorial- MySQL
    • Tutorial- Python
    • Competitive Coding Challenges
  • CSE Subject
    • (CD) Compiler Design
    • (CN) Computer Network
    • (COA) Computer Organization & Architecture
    • (DBMS) Database Management System
    • (DS) Data Structure
    • (OS) Operating System
    • (ToA) Theory of Automata
    • (WT) Web Technology
  • Interview Questions
    • Interview Questions- Company Wise
    • Interview Questions- Coding Round
    • Interview Questions- Python
    • Interview Questions- REST API
    • Interview Questions- Web Scraping
    • Interview Questions- HR Round
    • Aptitude Preparation Guide
  • GATE 2021
  • Linux
  • Trend
    • Full Stack Development
    • Artificial Intelligence (AI)
    • BigData
    • Cloud Computing
    • Machine Learning (ML)
  • Write for Us
    • Submit Article
    • Submit Source Code or Program
    • Share Your Interview Experience
  • Tools

[Solved] Maximum Sum Subarray | Microsoft Interview Question

Sachin Sharma/762/0
CodeJAVAPython
YouTube CSEstack

Problem Statement / Task: You are given an array of integers (includes both positive and negative numbers). You have to find the sum of that subarray that has the highest sum among all the sub-arrays that can be formed including the array itself.

Example:

Input : -2  -1  -3  1  1  1  -4 
Output : 3

Explanation: The subarray [1,  1,  1] has the highest sum (which is 3) in all the sub-arrays.

This coding question was asked in Microsoft coding interview.

MAXIMUM SUM SUBARRAY

Note: In this program, we are using Kaden’s Algorithm you can find more here.

Python Program

Prerequisite:

  • Complete Python Tutorial
  • Python map() function

Code:

def sub_Array_Sum(lst):
    max_now = 0
    max_end = 0
    for i in range(len(lst)):
        max_now = max_now+lst[i]
        if max_now < 0:
            max_now = 0
        elif max_end < max_now:
            max_end = max_now
    return max_end

print("Enter values for array:")
l = list(map(int, input().split()))
print("Maximum Sum Subarray: ", sub_Array_Sum(l))

Output:

Enter values for array: 
-2 -1 -3 1 1 1 -4
Maximum Sum Subarray: 3

Java Program

Prerequisite:

  • Complete Java Tutorial

Code:

class Main {
    public static void main(String[] args) {
        int[] array = {-2, -1, -3, 1, 1, 1, -4};
        System.out.println("Max sum subarray:" + subArraySum(array));
    }
    
    public static int subArraySum(int[] arr) {
        int max_now = 0, max_end = 0;
        for (int i = 0; i < arr.length; i++) {
            max_now = max_now + arr[i];
            if (max_now < 0)
                max_now = 0;
            else if (max_end < max_now)
                max_end = max_now;
        }
        return max_end;
    }
}

Output:

Max sum subarray: 3

Complexity

In interview, sometimes you will be asked to find the complexity of the your written code.

The complexity of the above program is O(n) as we are traversing each element in the list at once.

Similar Competitive Coding Challenges:

  • Smallest Subarray with Sum Greater Than Given Number
  • Split Array into Equal Sum Subarrays

This is all about the maximum sum subarray problem asked in the Microsoft interview. You can implement this logic in any other programming language of your choice.

coding challenge
Sachin Sharma
I am Sachin Sharma a complete JAVA geek and I also have good knowledge of Python, C, C++, and front-end development. I am a 5-star gold coder on Hckerrank in JAVA, Python, C++, and DSA. I am eager to share my coding knowledge to help people.

Your name can also be listed here. Got a tip? Submit it here to become an CSEstack author.

Leave a Reply Cancel reply

Why?

Why Competitive Programming Important?

Coding Challenges for Practice

  1. Count Common Factor
  2. Does it Divide
  3. Sum of Sub Arrays
  4. Remove Duplicate Char from String
  5. Sort String by Char Freq (Python)
  6. Sort String by Char Freq (Java)
  7. Split Array into Equal Sum Subarray
  8. Validate IP Address
  9. Validate PAN Card Number
  10. Sort Circular Rotated Array
  11. Min Arrow to Burst Bubbles
  12. HourGlass with Largest Sum
  13. Max Profit by Buying/Selling Stocks
  14. Hailstone Sequence
  15. Reverse String without affecting Special Characters
  16. Secure Conversation by Encry/Decry
  17. Special Elements in Matrix
  18. Next Greater No with Same set of Digits
  19. Smallest Subarray with Sum Greater than Given Number
  20. Group Anagrams
  21. Find Duplicates in Array in O(n)
  22. Find Two Unique Numbers from Array in O(n)
  23. Number Patterns & Finding Smallest Number
  24. Minimum Cost of Merging Files [Amazon]
  25. Minimum Distance for Truck to Deliver Order [Amazon]
  26. Minimum Coins Required
  27. Max Sum Subarray
  28. Merge Overlapping Intervals
  29. Longest Balanced Subarray
  30. Longest Path in a Weighted Tree
  31. Generate Balanced Parentheses
  32. PostOrder Traversal Without Recursion

© 2021 – CSEstack.org. All Rights Reserved.

  • Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard