How should I practice Maximum Subarray Sum with Equal Endpoints?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Maximum Subarray Sum with Equal Endpoints associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Maximum Subarray Sum with Equal Endpoints

Google● MediumINTERNNEW GRADONSITE INTERVIEW

Problem statement

Source note: Two firsthand Google Software Engineer Internship reports preserve the base maximum-sum task; the later exact statement confirms inclusive endpoints and permits i equal to j. A separate Google New Grad onsite report directly asks for the maximizing indices, confirms mixed positive and negative values, and records a strict O(1)-extra-space follow-up where higher time complexity is acceptable. This same-ID correction restores the source-required [i,j] output while preserving that earlier provenance. The reports omit finite bounds and deterministic ties, so the practice contract adds earliest-index tie-breaking. The judged core matches the latest visible source at about 95%. Based on an additional interview report found on October 14, 2026 (interviewed October 13), we added the [1,2,3,2,5] -> [1,3] example and the separate O(n)-time, O(1)-extra-space follow-up that removes endpoint equality. The existing equal-endpoint task and its earlier constant-space follow-up are preserved.

Given an integer array nums, choose indices i and j such that i <= j and nums[i] == nums[j].

The score of a pair is the inclusive subarray sum nums[i] + nums[i + 1] + ... + nums[j]. Return [i, j] for a pair with the maximum score.

If several pairs have the same maximum score, choose the one with the smallest i; if there is still a tie, choose the smallest j. A one-element subarray is valid, so an answer always exists.

The problem statement continues

Pro

Examples

Example 1

nums = [2,-5,2,4,2]return = [2,4]

The endpoints at indices 2 and 4 are both 2, and their inclusive sum is 8, larger than every other valid pair.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
3 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Google hiring insights