


If a number has trailing zeros, then its reverse will not include them. For e.g., the reverse of 10400 will be 401 instead of 00401.
The first line contains an integer 'T' which denotes the number of test cases or queries to be run.
The first line of each test case contains one integer ‘N’ denoting the given number.
For each case, you need to print the reverse of the given number.
The output of each test case will be printed on a separate line.
You do not need to input or print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 5
1 <= N <= 10 ^ 18
Time Limit = 1 sec
Firstly to solve the problem of trailing zeros, we can run a while loop that shall divide the number by 10 and the condition for the while loop shall be that the modules of the number by 10 should be 0. Once we are done with this, we will run a while loop for reversing the number. The loop will be functional till the time n is greater than 0. Inside the loop, we will be taking out the last digit of the number using the modulus operator and appending it to a new answer variable which is declared outside the loop. After this, the number will be divided by 10 as we do not need the later digit anymore.
First N
Can You Print
Print Name
Print Name
Print Name
Print Name
Print Name
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Count Repeating Digits