Recursive Algorithms

Recursion is a technique used in computer science to solve big problems by breaking them into smaller, similar problems. The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. Using a recursive algorithm, certain problems can be solved quite easily.

Basics

• Introduction
• Tail Recursion
• Tail Recursion Elimination

In Different Languages

• Recursion in Python
• Recursion in Java
• Recursion in C#
• Recursion in JavaScript

Easy Problems

• Factorial
• Print 1 to n
• Print n to 1
• Sum of array
• Reverse a string
• Decimal to binary
• Sum of digit
• Array Min and Max
• Palindrome Check

Medium Problems

• Mean of Array
• Adjacent duplicates
• Coin Change
• Binary to Gray
• Longest palindromic substring
• Tower of Hanoi
• Compute nCr
• Permutations
• Subsets
• Possible paths in matrix
• Combinations of Parentheses

Hard Problems

• Sort a Queue
• Sort a Stack
• Palindromic Partitions
• Scrambled Strings
• Word Break Problem
• N Queen Problem
• Sudoku Solver
• Knight's Tour

Practice Sets on Recursion

• Recursive Practice Problems with Solutions
• Practice Questions for Recursion | Set 1
• Practice Questions for Recursion | Set 2
• Practice Questions for Recursion | Set 3
• Practice Questions for Recursion | Set 4
• Practice Questions for Recursion | Set 5
• Practice Questions for Recursion | Set 6
• Practice Questions for Recursion | Set 7
• Practice questions for Linked List and Recursion

Quiz based on Recursion:

• Top MCQs on Recursion Algorithm with Answers