Pair with Given Target Sum
Uses hash complement set to detect pair summing to target in single pass.
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 two_sum(arr, target):
seen = {}
for i, num in enumerate(arr):
comp = target - num
if comp in seen:
return seen[comp], i
seen[num] = i
return -1Embed this visualization
Drop a live, looping Pair with Given Target Sum canvas into a blog post or course page.
<iframe src="/embed/pair-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 Pair with Given Target Sum?
Pair with Given Target Sum runs in O(n) time and O(n) auxiliary space.
Is the Pair with Given 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 Pair with Given Target Sum in interviews?
Pair with Given Target Sum shows up in interviews at Atlassian, Shopify, LinkedIn.
How does the 3D visualization of Pair with Given 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.