← FactSet questions

Largest Contiguous Subarray Sum

Filed under FactSet · Also reported at MX Player

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

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