Is there any more optimised soln for this qsn

#1
#2

@rsumitaj hey yes there is other optimise soln than sorting which is using three pointers ,try that approach.

#3

can you please explain the algorithm

#4

@rsumitaj hey here is the algorithm:

  1. Keep three indices low = 1, mid = 1 and high = N and there are four ranges, 1 to low (the range containing 0), low to mid (the range containing 1), mid to high (the range containing unknown elements) and high to N (the range containing 2).
  2. Traverse the array from start to end and mid is less than high. (Loop counter is i)
  3. If the element is 0 then swap the element with the element at index low and update low = low + 1 and mid = mid + 1
  4. If the element is 1 then update mid = mid + 1
  5. If the element is 2 then swap the element with the element at index high and update high = high – 1 and update i = i – 1. As the swapped element is not processed
  6. Print the output array.
#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.