Consider L = 10, R = 13.
Then, all integers in range [10, 13] are 10, 11, 12, 13.
We can say, that 10 is a stepping number because |1 - 0| = 1.
11 is not a stepping number because |1 - 1| = 0.
12 is a stepping number because |1 - 2| = 1.
13 is not a stepping number because |1 - 3| = 2.
Thus, we should return a list [10, 12].
The first line of input contains an integer ‘T’ denoting the number of test cases. Then, ‘T’ test cases follow.
The first and the only line of each test case consist of two space-separated integers ‘L’ and ‘R’ respectively.
For each test case, if there are ‘K’ stepping numbers between ‘L’ and ‘R’, then print a single line consisting of ‘K’ space-separated integers representing Stepping Numbers between ‘L’ and ‘R’ in increasing order.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 50
1 <= L <= 10^8
1 <= R <= 10^8
R >= L
Time Limit: 1 second
COUNT ISLANDS
Capturing Grid
Rotting Oranges
Distance to a Cycle in Undirected Graph
8-Queen Problem