← Samsung questions
CodingReported in a candidate post, Jul 2025

3Sum Problem

Filed under Samsung · Also reported at Cloudera, Goldman Sachs, Myntra, UKG, Yatra.com

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not…

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 Samsung questions

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