← OYO questions

Print all triplets with sum equal to K

Filed under OYO

Given an integer array `nums` and an integer `K`, find and return all unique triplets `[nums[i], nums[j], nums[k]]` such that `i != j != k` and `nums[i] + nums[j] + nums[k] == K`. The output 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 OYO questions

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