Sort 0 1 2 Problem Statement
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the number of test cases. Each test case consists of two lines. The first line contains an integer 'N', the size of the array. The second line contains 'N' space-separated integers, the elements of the array.
Output:
For each test case, output the sorted array as space-separated integers in a new line.
Example:
Input:
2
5
0 2 1 2 0
3
2 1 0
Output:
0 0 1 2 2
0 1 2
Constraints:
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 5 * 105
- 0 ≤ arr[i] ≤ 2
- Time Limit: 1 sec
Note:
Try to solve the problem using a single scan over the array. You need to modify the array in-place and do not return anything.
Charan Singh
1y
function sort0_1_2(arr) { let current = 0; let zeroPos = 0; let twoPos = arr.length - 1; while (current <= twoPos) { if (arr[current] === 0) { [arr[current], arr[zeroPos]] = [arr[zeroPos], arr[current...read more
Help your peers!
Add answer anonymously...
Top Deloitte Software Developer interview questions & answers
Popular interview questions of Software Developer
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app