Pergunta de entrevista da empresa Vimaan Robotics
Sort an array of 0s, 1s and 2s inplace
Resposta da entrevista
Sigiloso
13 de jan. de 2025
int low = 0, mid = 0, high = arr.size()-1; while(mid <= high){ if(arr[mid]==0){ swap(arr[low], arr[mid]); low++; mid++; } else if(arr[mid]==1){ mid++; } else{ swap(arr[mid], arr[high]); high--; } } Time Complexity: O(n) Space Complexity: O(1)