← Microsoft questions

Maximum subarray problem in one pass

Filed under Microsoft

Given an array of integers, find the contiguous subarray with the largest sum. The solution must traverse the array exactly once.

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 Microsoft questions

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