Problem Statement
Find the duplicate number in array of n+1 integers from 1 to n.
Approach
Treat array as linked list. Use slow/fast pointers to find cycle, then find entry point.
Time & Space Complexity
Time O(n), Space O(1).
This experience deserves a bigger screen
The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview