|All-time Popular Problems|
|Delete without head pointer|
|Check if a number is power of another number|
|Array to BST|
|Implement Queue using Linked List|
|Lowest Common Ancestor in a BST|
|Reverse a Linked List in groups of given size.|
|Print all nodes that don’t have sibling|
|Equal to product|
Given two numbers a and b find all the number between the given range whose second least significant digit in the binary representation of the number is 1.
The line contains T i.e. number of test cases. The next T line contains two integers a and b each.
For each of the test case print the corresponding answer in separate lines.
1<= T <= 10^5
1 <= a<=b <=10^9
In the given range 2 (10) and 3 (11) are the numbers whose second least significant digit in its binary representation is 1.