Triplet With Target Sum (3Sum)
Sorts array, fixes first element, and uses two-pointers to find triplets.
Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.
Asked in interviews at
Reference implementation (Python)
def three_sum(arr, target=0):
arr.sort()
triplets = []
for i in range(len(arr) - 2):
l, r = i + 1, len(arr) - 1
while l < r:
s = arr[i] + arr[l] + arr[r]
if s == target:
triplets.append((arr[i], arr[l], arr[r]))
l += 1; r -= 1
elif s < target: l += 1
else: r -= 1
return tripletsEmbed this visualization
Drop a live, looping Triplet With Target Sum (3Sum) canvas into a blog post or course page.
<iframe src="/embed/triplet-with-sum" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>Frequently asked
What is the time and space complexity of Triplet With Target Sum (3Sum)?
Triplet With Target Sum (3Sum) runs in O(n²) time and O(1) auxiliary space.
Is the Triplet With Target Sum (3Sum) visualizer free?
The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.
Which companies ask Triplet With Target Sum (3Sum) in interviews?
Triplet With Target Sum (3Sum) shows up in interviews at Spotify, Google, Airbnb.
How does the 3D visualization of Triplet With Target Sum (3Sum) work?
Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.