Top 50 Problems on Recursion Algorithm

Recursion is one of the most essential algorithms that uses the concept of code reusability and repeated usage of the same piece of code. In this post, we have curated an extensive list of interview questions asked around the Recursion Algorithm. The point that makes Recursion one of the most used algorithms is that it forms the base for many other algorithms,such as:

• Tree traversals
• Graph traversals
• Divide and Conquer Algorithms
• Backtracking algorithms 

To learn more about the Recursion Algorithm, Please refer to the Tutorial on Recursion Algorithms

Easy Problems using Recursion

• Print 1 to n without using loops
• Print n to 1 without loop
• Mean of Array
• Sum of natural numbers
• Decimal to binary number
• Sum of array
• Reverse of a string
• Length of a string
• Sum of digit
• Sum of array using tail recursion
• First n Fibonacci Numbers
• Factorial of a number
• Minimum and Maximum in array
• Palindrome Check
• Count Set-bits
• Fibonacci Series in reverse
• Reverse a Linked List using Recursion

Medium Problems using Recursion

• Flood Fill Algorithm
• Remove all adjacent duplicates
• Sort the Queue
• Reversing a queue
• Binary to Gray code
• Delete a linked list
• Product of 2 Numbers
• Printing Pyramid Patterns
• Longest palindromic sub-string
• Tower of Hanoi Algorithm
• Time Complexity of Tower Of Hanoi
• Calculate nCr
• Geometric sum of the series
• Convert a String to an Integer
• DFS traversal of a Tree
• Bottom View of a Binary Tree
• Permutations of given String
• Subsets of a given Set or Array
• All Paths from Top-Left to Bottom-Right of Matrix
• All combinations of balanced parentheses
• Longest Common Subsequence (LCS)
• Right View of a Binary Tree

Hard Problems using Recursion

• Number raised to its reverse
• Sort a Stack using Recursion
• Reverse a Doubly linked list
• All palindromic partitions
• Scrambled Strings
• Word Break Problem
• All palindromic partitions
• N Queen Problem
• Sudoku Solver
• The Knight's tour problem
• N-digit Numbers with |K| Difference Between Adjacent Digits
• Josephus Problem

Related Article:

• DSA Tutorial
• Top 50 Problems on Stack for Interviews
• Top 50 Dynamic Programming Coding Problems for Interviews
• Top 50 Problems on Linked List for Interviews
• Top 50 Problems on Queue for Interviews