Swap Adjacent Bit Pairs Problem Statement

Given an integer N, your task is to compute the number that results from swapping each even position bit of N's binary representation with its adjacent odd bit to the right. Consider the least significant bit as an odd position.

Example:

Input:

N = 45

Output:

30

Explanation:

The binary representation of 45 is 101101. After swapping each even bit with its adjacent odd bit to the right, it results in 011110, which is the integer 30.

Constraints:

1 ≤ T ≤ 10⁵

1 ≤ N ≤ 10⁹

Time Limit: 1 sec

Question

Swap Adjacent Bit Pairs Problem Statement

Given an integer N, your task is to compute the number that results from swapping each even position bit of N's binary representation with its adjacent odd bit to the right. Consider the least significant bit as an odd position.

Example:

Input:

N = 45

Output:

Explanation:

The binary representation of 45 is 101101. After swapping each even bit with its adjacent odd bit to the right, it results in 011110, which is the integer 30.

Constraints:

1 ≤ T ≤ 10⁵
1 ≤ N ≤ 10⁹
Time Limit: 1 sec

Accepted Answer

Swap each even position bit of an integer with its adjacent odd bit to the right in binary representation.

Iterate through the binary representation of the integer and swap adjacent bits at even positions with odd positions.
Convert the modified binary representation back to an integer to get the final result.
Handle edge cases like leading zeros in binary representation.