Skip to main content
All Questions

Given a sequence A of up to 100,000 numbers, find a pair of positions i and j with |i - j| > 1 that minimises A[i] + A[j].

Unlock detailed company stats for this questionUpgrade

Community answers

No answers contributed by the community yet.

Related questions

Given a string with parentheses, write a function that removes the minimum number of characters to balance the parentheses.Given a set of numbers, find the number in the set that is closest to the mean of the entire set.Given a list of words, find the number of prefix pairs, i.e. pairs i, j where words[i] == words[j] or words[i].startswith(words[j]) or words[j].startswith(words[i]).

Related courses

Course

Behavioral Interviews: A Practical Guide for Engineers

Get offers at the level you deserve. Prep for senior+ behavioral interviews at FAANG and Tier-1 companies. Made with staff and principal engineers from Meta, Netflix, Google, and more. Avoid downleveling, elevate past projects, and stop sounding like a robot.

Course

Software Engineering Interview Prep

Land your dream software engineering role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates—practice data structures, algorithms, system design, people management, behavioral interviews, and more.