← Google questions

Maximum Subarray Sum

Filed under Google · Also reported at Accenture, American Express, Arcesium, Cadence, Early-Stage Startup, Electronic Arts, Goldman Sachs, Informatica and 7 more

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.