How should I practice Maximum Subarray?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Square Point onsite interview problems in FastPrep.

Is Maximum Subarray associated with Square Point?

FastPrep tags this as a Square Point onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Maximum Subarray

Learn this problem

● Easy

Square PointFULLTIMEONSITE INTERVIEW

Problem statement

You are given an integer array nums. Find the non-empty contiguous subarray with the largest sum and return that sum.

Function

maxSubArray(nums: int[]) → int

Examples

Example 1

nums = [-2,1,-3,4,-1,2,1,-5,4]return = 6

The best contiguous subarray is [4,-1,2,1], whose sum is 6.

Constraints

1 <= nums.length <= 100000
-10000 <= nums[i] <= 10000
The answer fits in a signed 32-bit integer.