All Pairs with Target Sum
Finds all unique pairs summing to target value.
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 all_pairs_sum(arr, target):
pairs = []
n = len(arr)
for i in range(n):
for j in range(i + 1, n):
if arr[i] + arr[j] == target:
pairs.append((arr[i], arr[j]))
return pairsEmbed this visualization
Drop a live, looping All Pairs with Target Sum canvas into a blog post or course page.
<iframe src="/embed/all-pairs-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 All Pairs with Target Sum?
All Pairs with Target Sum runs in O(n²) time and O(n) auxiliary space.
Is the All Pairs with Target Sum 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 All Pairs with Target Sum in interviews?
All Pairs with Target Sum shows up in interviews at Netflix, Amazon, ByteDance.
How does the 3D visualization of All Pairs with Target Sum 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.