Find Third Smallest Number
Tracks 3 distinct minimums in linear time.
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 third_smallest(arr):
s1 = s2 = s3 = float('inf')
for x in arr:
if x < s1:
s3, s2, s1 = s2, s1, x
elif x < s2 and x != s1:
s3, s2 = s2, x
elif x < s3 and x not in (s1, s2):
s3 = x
return s3Embed this visualization
Drop a live, looping Find Third Smallest Number canvas into a blog post or course page.
<iframe src="/embed/third-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 Third Smallest Number?
Find Third Smallest Number runs in O(n) time and O(1) auxiliary space.
Is the Find Third 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 Third Smallest Number in interviews?
Find Third Smallest Number shows up in interviews at Amazon, Apple, Stripe.
How does the 3D visualization of Find Third 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.