Reverse a number recursively.
Difficulty: Hard
Phase: 3 · Recursion
XP Reward: 30 XP
Topics: Recursion, Hard
Supported Languages: Python, JavaScript, C, C++, Java
Problem Description
Given positive integer N, reverse its digits recursively without leading zeros. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).
Constraints
- -10^9 <= N <= 10^9
Examples
Example 1
Input: 1234
Output: 4321
Explanation: Sample execution for input 1234