Was asked this question for one of the comapines phone interview...
Was wondering if anyone knows the soltuion or similar problem on leetcode//

Give Pair Array find all possible numbers in that range....
Example1:

Input2d Array : (2,4), (3,5)
For (2,4) range is from 2->4 which is 2,3,4
For (3,5) range is 3->5 which is 3,4,5

output: 23,24,25,33,34,35,43,44,45

Example 2:
Input2d Array : (2,4), (3,5), (1,2)
output: 231,241,251,331,341,351,431,441,451 and so on....

Constraints: All input pairs are greater than or equal to 1 and sorted in ascending order. (Eg: it would be (2,4) and not (4,2))