Can you solve this in logarithmic time and space complexity?
The first line of input contains a single integer 'T', representing the number of test cases.
The first line of each test contains a single integer 'N', denoting the URL id.
For each test case, return a short URL for the URL id.
You don't need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 1000
0 <= N <= 10^18
Time limit: 1sec
Can You Print
Prime Digit Sum
Prime Digit Sum
Mario And His Princess
Matrix Boundary Traversal
8-Queen Problem