← OYO questions
CodingReported in a candidate post, Jun 2021

4Sum Problem

Filed under OYO · Also reported at Amazon

Given an array of n integers, find all unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that the sum equals a target value.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.