How should I practice Maximize Two Endpoint Values?

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

Is Maximize Two Endpoint Values associated with Google?

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

Problem · Array

Maximize Two Endpoint Values

● Easy

GoogleFULLTIMEONSITE INTERVIEW

See Google hiring insights

Problem statement

You are given an integer array values. Choose two indices i and j with i < j.

The score of the chosen pair is

sum(values[i..j]) - sum(values[i+1..j-1]),

The problem statement continues

Pro

Examples

Example 1

values = [4,1,7,3]return = 11

Choose the endpoints with values 4 and 7. Interior values cancel from the two range sums, so the score is 4 + 7 = 11.

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