10 Simple Recursion Problems (Java, JavaScript, Python)

Recursion becomes easy only with practice. Here are 10 beginner-friendly problems to master recursion. 1. Print Numbers from 1 to N Python def printN(n): if n == 0: return printN(n-1) print(n) printN(5) Java static void printN(int n){ if(n == 0) return; printN(n-1); System.out.println(n); } JavaScript function printN(n){ if(n === 0) return; printN(n-1); console.log(n); } 2. Print Numbers from N to 1 def reverse(n): if n == 0: return print(n) reverse(n-1) static void reverse(int n){ if(n == 0) return; System.out.println(n); reverse(n-1); } function reverse(n){ if(n === 0) return; console.log(n); reverse(n-1); } 4. Factorial def fact(n): if n == 1: return 1 return n * fact(n-1) static int fact(int n){ if(n == 1) return 1; return n * fact(n-1); } function fact(n){ if(n === 1) return 1; return n * fact(n-1); } 4. Sum of N Numbers def sumN(n): if n == 0: return 0 return n + sumN(n-1) static int sumN(int n){ if(n == 0) return 0; return n + sumN(n-1); } function sumN(n){ if(n === 0) return 0;