Skip to content
ArrayMedium

Intersection of Two Arrays

Finds intersection set of values present in both arrays without duplicates.

Time O(n + m) Space O(n)
Open in 3D Studio

Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.

Asked in interviews at

MicrosoftAppleBloomberg

Reference implementation (Python)

def intersection(a, b):
    return list(set(a) & set(b))

Embed this visualization

Drop a live, looping Intersection of Two Arrays canvas into a blog post or course page.

<iframe src="/embed/intersection-two-arrays" 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 Intersection of Two Arrays?

Intersection of Two Arrays runs in O(n + m) time and O(n) auxiliary space.

Is the Intersection of Two Arrays 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 Intersection of Two Arrays in interviews?

Intersection of Two Arrays shows up in interviews at Microsoft, Apple, Bloomberg.

How does the 3D visualization of Intersection of Two Arrays 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.

More Array