Sort an array of 0s, 1s and 2s GeeksforGeeks || Adobe Amazon Microsoft Coding Question || Easy

preview_player
Показать описание
Given an array of size N containing only 0s, 1s, and 2s; sort the array in ascending order.

Example 1:

Input:
N = 5
arr[]= {0 2 1 2 0}
Output:
0 0 1 2 2
Explanation:
0s 1s and 2s are segregated
into ascending order.
Example 2:

Input:
N = 3
arr[] = {0 1 0}
Output:
0 0 1
Explanation:
0s 1s and 2s are segregated
into ascending order.

Your Task:
You don't need to read input or print anything. Your task is to complete the function sort012() that takes an array arr and N as input parameters and sorts the array in-place.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)
Рекомендации по теме
Комментарии
Автор

Very very nice explanation. I saw many videos but not clear. Your explanation was just crisp and neat👌. Can you pls solve all the grind 75 list questions.

venkatakalyan
Автор

The explanation was amazing..keep doing 👍

bhimeshyadav
Автор

The explanation was quite clear....thank you :)

newera
Автор

Simply count the frequencies in one iteration and then refill array using these frequencies in another iteration?

Wolverine_
Автор

Explanation is superb but kindly use the mic in future for better voice quality

UCSAkhilPrasad
Автор

Ma'am. 29 line where you write else if(a[mid==2]) // else if(a[mid]==2) which is right answer?

krishanusantrakrish
Автор

Funfact is that if you just write sort(a, a+n), it will work although it is using nlogn but all test cases will be passed

officialtheunderground
Автор

Why don't just count the number of 0, 1, 2s, an then override the values of the array?

aldoalf
join shbcf.ru