Maximum Subarray Sum with a Length Cap

Company: Oracle

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Compute the maximum sum of a nonempty contiguous subarray whose length cannot exceed a given cap. The prompt fixes negative-only behavior, integer-width expectations, and two exact examples for later cross-language console verification.

Read the full Oracle Software Engineer interview experience this question came from