Problem Statement
Sort array containing only 0s, 1s, and 2s in-place.
Approach
Use three pointers: low, mid, high. Swap elements to partition into three regions.
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