Minimum Difference in Array
Sorts array and scans adjacent elements to find minimum absolute difference.
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 min_difference(arr):
arr.sort()
min_diff = float('inf')
for i in range(len(arr) - 1):
min_diff = min(min_diff, arr[i+1] - arr[i])
return min_diffEmbed this visualization
Drop a live, looping Minimum Difference in Array canvas into a blog post or course page.
<iframe src="/embed/min-difference" 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 Minimum Difference in Array?
Minimum Difference in Array runs in O(n log n) time and O(1) auxiliary space.
Is the Minimum Difference in Array 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 Minimum Difference in Array in interviews?
Minimum Difference in Array shows up in interviews at Meta, Google, Uber.
How does the 3D visualization of Minimum Difference in Array 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.