Triplet Sums

Medium2s max execution

Given an array of integers and a target sum, find all unique triplets in the array that sum up to the target value. The challenge is to handle duplicates efficiently and consider various edge cases.

🎯 Problem Requirements:

  1. Input format:
    • An array of integers (positive, negative, or zero)
    • A target sum value
  2. Constraints:
    • Find all unique triplets (i,j,k) where array[i] + array[j] + array[k] = targetSum
    • Each triplet should be returned in ascending order
    • The solution set must not contain duplicate triplets
    • Array indices i, j, and k must be different

💡 Example:

For array [-1, 0, 1, 2, -1, -4] and targetSum = 0:

  • Valid triplets: [[-1, -1, 2], [-1, 0, 1]]
  • Note: [-1, -1, 2] uses two different -1s from the array
  • Triplets are sorted internally and in the output

📝 Your Task:

Implement the solve method to find all unique triplets that sum to the target value. Consider using techniques like sorting and two-pointer approach for efficiency.

Examples:

Input: [[-1,0,1,2,-1,-4], 0]
Output: [[-1,-1,2],[-1,0,1]]

Found two unique triplets that sum to zero

Input: [[1,1,1,1], 3]
Output: [[1,1,1]]

Single triplet using three 1s from the array

Input: [[0,0,0,0], 0]
Output: [[0,0,0]]

Single triplet of zeros, duplicates handled

Constraints:

  • •0 ≤ nums.length ≤ 3000
  • •-105 ≤ nums[i] ≤ 105
  • •-105 ≤ target ≤ 105
TypeScript solution with full type checking
Loading...

Custom Test Input

Output

Run your code to see output...