โ† Amazon questions

Maximum Subarray (Contiguous and Non-Contiguous)

Filed under Amazon

Given an array A of N elements, find the maximum possible sum of a contiguous subarray and a non-contiguous (subsequence) subarray.

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

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