Problem Statement
Merge arr1 and arr2 which are sorted.
Approach
Two pointers from start. Compare and place smaller element.
Time & Space Complexity
Time O(m+n), Space O(m+n).

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
Merge two sorted arrays into one.
Merge arr1 and arr2 which are sorted.
Two pointers from start. Compare and place smaller element.
Time O(m+n), Space O(m+n).
Loading Interactive Visualizer...
Click "Play" or use arrow keys to step through the execution.