How should I practice Maximum Subarray Endpoint Score?

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 Endpoint Score 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 Endpoint Score

Google● MediumINTERNONSITE INTERVIEW

Problem statement

You are given an integer array nums, which may contain negative values.

Choose a contiguous subarray nums[i..j] containing at least two elements, so i < j. Its score is the sum of its two endpoint values minus the sum of all values strictly between them:

score(i,j) = nums[i] + nums[j] - sum(nums[i+1..j-1]).

The problem statement continues

Pro

Examples

Example 1

nums = [5,-100,5]return = 110

The full array scores 5 + 5 - (-100) = 110. Either adjacent pair scores -95.

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
2 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