Find All Duplicate Elements
Uses a seen set to detect and collect recurring values.
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 find_duplicates(arr):
seen = set()
duplicates = []
for x in arr:
if x in seen and x not in duplicates:
duplicates.append(x)
seen.add(x)
return duplicatesEmbed this visualization
Drop a live, looping Find All Duplicate Elements canvas into a blog post or course page.
<iframe src="/embed/find-duplicates" 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 Find All Duplicate Elements?
Find All Duplicate Elements runs in O(n) time and O(n) auxiliary space.
Is the Find All Duplicate Elements 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 Find All Duplicate Elements in interviews?
Find All Duplicate Elements shows up in interviews at Nvidia, Intel, Qualcomm.
How does the 3D visualization of Find All Duplicate Elements 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.