Find Second Smallest Number
Maintains smallest and second smallest element tracking in single O(n) iteration.
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 second_smallest(arr):
first = second = float('inf')
for num in arr:
if num < first:
second = first
first = num
elif num < second and num != first:
second = num
return secondEmbed this visualization
Drop a live, looping Find Second Smallest Number canvas into a blog post or course page.
<iframe src="/embed/second-smallest" 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 Second Smallest Number?
Find Second Smallest Number runs in O(n) time and O(1) auxiliary space.
Is the Find Second Smallest Number 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 Second Smallest Number in interviews?
Find Second Smallest Number shows up in interviews at Uber, Microsoft, DoorDash.
How does the 3D visualization of Find Second Smallest Number 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.