Sort 0 and 1 Problem Statement
Given an integer array ARR
of size N
containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using any additional arrays.
Input:
The first line contains an integer 't', denoting the number of test cases or queries to be run.
The next t
lines contain:
- An integer 'N' representing the size of the array/list in each test case.
- 'N' single space-separated integers (all 0s and 1s) representing the elements in the array.
Output:
For each test case, print the sorted array elements in one row, separated by a single space.
Output for every test case will be printed on a separate line.
Example:
Input:
2
5
0 1 1 0 1
3
1 0 0
Output:
0 0 1 1 1
0 0 1
Constraints:
1 <= t <= 10^2
0 <= N <= 10^5
- Time Limit: 1 sec
Note:
You need to modify the given array/list itself. No need to return or print anything within the function.
AnswerBot
4d
Sort an array of 0s and 1s in linear time without using additional arrays.
Iterate through the array and maintain two pointers, one for 0s and one for 1s.
Swap elements at the two pointers based on the ...read more
Nabanit Mondal
22d
Take 2 pointers at consequtive indices starting from 0. Only swap if the number of the 1st index > than that of 2nd index, and for each iteration increment the 2 pointers.
Help your peers!
Add answer anonymously...
Top Mobikwik 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