Algorithm for Reversing a Number in Java

To reverse a number following steps should be performed:

• Take the number’s modulo by 10.
• Multiply the reverse number by 10 and add modulo value into the reverse number.
• Divide the number by 10.
• Repeat above steps until number becomes zero.

In Java, reversing a number means that the digit at the first position should be swapped with the last digit, the second digit will be swapped with the second last digit, and so on till the middle element.

Note: Leading zeros will not be considered after reversing (i.e, After reversing 100 will become 001 ≈ 1).