Software Engineer

You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

Note :

Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.

Given an array with N elements, the task is to reverse all the array elements and print the reversed array.

You are given two arrays of integers. Let's call the first array A and the second array B. A finds the number of elements in array B that are smaller than or equal to that element for every array element.

For example:

A = [2, 3, 0] , B = [5, 1]

For the first index, A[0] = 2
In array B only 1 is less than 2. Therefore the answer for the first index is 1.

For the second index, A[1] = 3
In array B only 1 is less than 3. Therefore the answer for the second index is also 1.

For the third index, A[2] = 0
Both the elements of array B are greater than 0. 
Therefore the answer for the third index is 0.

Hence, the final answer is [1,1,0] in this case.

Concepts about oops like what are main features (encapsulation, abstraction, inheritance and polymorphism.) what is polymorphism and its types

What is union and how it differ from struct

There is a rope which can burn totally in an hour and you have a matchstick to ignite the rope. How to calculate 45 minutes by using the rope

Suppose you are working on some problem in your company and you get stuck at something and you don't know how to solve this. How will you handle the situation ?