DSA question. Question -> Given a binary array, we need to bring all the 0s to the left side and all the 1s to the right side of the array. Sorting will be very naive. They expected a solution with O(1) time and space complexity. Hint -> Two Pointers. Input -> [0,1,0,0,0,1,1,0,1,1] Output -> [0,0,0,0,0,1,1,1,1,1]