 New update is available. Click here to update.

# Sort By Kth Bit

Last Updated: 23 Feb, 2023
Easy 0/40
Avg time to solve 15 mins
Success Rate 90 % Share 26 upvotes

## Problem Statement

Suggest Edit

#### Note 2: You have to return the modified array/list..

##### For Example :
``````If ‘ARR’ is {1,2,3,4} and ‘K’ = 1, then after modification, ‘ARR’ should be {2,4,1,3} because ‘K-th’ (‘K’ = 1) of {2,4} is 0 and ‘K-th’ bit of {1,3} is 1.
``````
Detailed explanation ( Input/output format, Notes, Images ) ##### Constraints:
``````1 <= T <= 10
1 <= N <= 10^4
1 <= ARR[i] <= 10^9
1 <= K <= 31

Time Limit: 1 sec
``````
##### Sample Input 1:
``````2
4 1
4 3 2 1
5 2
2 5 1 6 7
``````
##### Sample Output 1:
``````4 2 3 1
5 1 2 6 7
``````
##### Explanation For Sample Input 1:
``````In example 1, the original ‘ARR’ is {4,3,2,1} and ‘K’ = 1. After modification, the ‘ARR’ should be {4,2,3,1} because {4,2} will come first as their 1st bit is 0 and {3,1} will come after that as their 1st bit is 1.

In example 2, the original ‘ARR’ is {2,5,1,6,7} and ‘K’ = 2. After modification the ‘ARR’ should be {5,1,2,6,7} because {5,1} will come first as their 2nd bit is 0 and {2,6,7} will come after that as their 2nd bit is 1.
``````
##### Sample Input 2:
``````2
5 1
3 6 2 1 4
5 3
7 6 2 9 3
``````
##### Sample Output 2:
``````6 2 4 3 1
2 9 3 7 6
``````
##### Explanation For Sample Input 2:
``````In example 1, the original ‘ARR’ is {3,6,2,1,4} and ‘K’ = 1. After modification the ‘ARR’ should be {6,2,4,3,1} because {6,2,4} will come first as their 1st bit is 0 and {3,1} will come after that as their 1st bit is 1.

In example 2, the original ‘ARR’ is {7,6,2,9,3} and ‘K’ = 3. After modification the ‘ARR’ should be {2,9,3,7,6} because {2,9,3} will come first as their 3rd bit is 0 and {7,6} will come after that as their 3rd bit is 1.
``````  Auto Console