How should I practice Two or Three Sum Existence?

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

Is Two or Three Sum Existence associated with Google?

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

Two or Three Sum Existence

Google● MediumINTERNONSITE INTERVIEW

Problem statement

Given an integer array nums sorted in nondecreasing order, an integer target, and k equal to 2 or 3, determine whether exactly k elements at distinct indices sum to target.

Return true if such a selection exists and false otherwise. Equal values at different indices may both be selected, but an index cannot be reused. If the array has fewer than k elements, return false.

Values may be negative, zero, or positive. Compute sums mathematically, without signed 32-bit overflow; use a wider integer type when necessary.

The problem statement continues

Pro

Examples

Example 1

nums = [1,2,4,7]target = 9k = 2return = true

The values at indices 1 and 3 are 2 and 7, whose sum is 9.

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