Recursive Practice Problems with Solutions Last Updated : 06 Feb, 2024 Comments Improve Suggest changes Like Article Like Report Basics - Recursion Recursive Functions Tail Recursion Strings - Given a string, print all possible palindromic partitions Check if a number is Palindrome Print all possible strings of length k that can be formed from a set of n characters Recursive Implementation of atoi() Find all even length binary sequences with same sum of first and second half bits Print all possible expressions that evaluate to a target String with additive sequence Generate all binary strings without consecutive 1’s Recursive solution to count substrings with same first and last characters All possible binary numbers of length n with equal sum in both halves Combinations in a String of Digits Count consonants in a string (Iterative and recursive methods) Program for length of a string using recursion First uppercase letter in a string (Iterative and Recursive) Partition given string in such manner that i’th substring is sum of (i-1)’th and (i-2)’th substring Power Set in Lexicographic order Function to copy string (Iterative and Recursive) Array - Print all possible combinations of r elements in a given array of size n Print all increasing sequences of length k from first n natural numbers Generate all possible sorted arrays from alternate elements of two given sorted arrays Program to find the minimum (or maximum) element of an array Sum triangle from array Stack - Reverse a stack using recursion Sort a stack using recursion Linked List - Recursive function to delete k-th node from linked list Recursive insertion and traversal linked list Reverse a Doubly linked list using recursion Delete a linked list using recursion Print alternate nodes of a linked list using recursion Recursive approach for alternating split of Linked List Find middle of singly linked list Recursively Practice questions for Linked List and Recursion Binary Tree - Print all leaf nodes of a Binary Tree from left to right Leaf nodes from Preorder of a Binary Search Tree (Using Recursion) Dynamic Programming - Print all longest common sub-sequences in lexicographical order Recursive Tower of Hanoi using 4 pegs / rods Time Complexity Analysis | Tower Of Hanoi (Recursion) Sorting - Recursive Bubble Sort Recursive Insertion Sort Mathematical - Print a pattern without using any loop Print all non-increasing sequences of sum equal to a given number x Print all n-digit strictly increasing numbers Print sums of all subsets of a given set Find ways an Integer can be expressed as sum of n-th power of unique natural numbers Recaman’s sequence 1 to n bit numbers with no consecutive 1s in binary representation Program for Sum the digits of a given number Count ways to express a number as sum of powers Find m-th summation of first n natural numbers Print N-bit binary numbers having more 1’s than 0’s in all prefixes Generate all passwords from given character set Minimum tiles of sizes in powers of two to cover whole area Alexander Bogomolny’s UnOrdered Permutation Algorithm Sum of natural numbers using recursion Decimal to binary number using recursion Sum of digit of a number using recursion Binary to Gray code using recursion Number of non-negative integral solutions of sum equation Product of 2 Numbers using Recursion Print all combinations of factors (Ways to factorize) Recursive program for prime number Programming Puzzles - Program for Chocolate and Wrapper Puzzle N Queen in O(n) space Misc - Mutual Recursion with example of Hofstadter Female and Male sequences Check if a destination is reachable from source with two movements allowed Minimum steps to reach a destination Identify all Grand-Parent Nodes of each Node in a Map C++ program to implement Collatz Conjecture 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 Category Archives: Recursion (Recent articles based on Recursion) Practice Problems on Geeks for Geeks! Comment More infoAdvertise with us Next Article Recursive Practice Problems with Solutions K kartik Follow Improve Article Tags : Algorithms Recursion Data Structures DSA tail-recursion +1 More Practice Tags : AlgorithmsData StructuresRecursion Similar Reads Introduction to Recursion The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read What is Recursion? Recursion is defined as a process which calls itself directly or indirectly and the corresponding function is called a recursive function.Example 1 : Sum of Natural Numbers Let us consider a problem to find the sum of natural numbers, there are several ways of doing that but the simplest approach is 8 min read Difference between Recursion and Iteration A program is called recursive when an entity calls itself. A program is called iterative when there is a loop (or repetition).Example: Program to find the factorial of a number C++ // C++ program to find factorial of given number #include<bits/stdc++.h> using namespace std; // ----- Recursion 6 min read Types of Recursions What is Recursion? The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inord 15+ min read Finite and Infinite Recursion with examples The process in which a function calls itself directly or indirectly is called Recursion and the corresponding function is called a Recursive function. Using Recursion, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Tr 6 min read What is Tail Recursion Tail recursion is defined as a recursive function in which the recursive call is the last statement that is executed by the function. So basically nothing is left to execute after the recursion call.For example the following function print() is tail recursive.C++// An example of tail recursive funct 7 min read What is Implicit recursion? What is Recursion? Recursion is a programming approach where a function repeats an action by calling itself, either directly or indirectly. This enables the function to continue performing the action until a particular condition is satisfied, such as when a particular value is reached or another con 5 min read Why is Tail Recursion optimization faster than normal Recursion? What is tail recursion? Tail recursion is defined as a recursive function in which the recursive call is the last statement that is executed by the function. So basically nothing is left to execute after the recursion call. What is non-tail recursion? Non-tail or head recursion is defined as a recur 4 min read Recursive Functions A Recursive function can be defined as a routine that calls itself directly or indirectly. In other words, a recursive function is a function that solves a problem by solving smaller instances of the same problem. This technique is commonly used in programming to solve problems that can be broken do 4 min read Difference Between Recursion and Induction Recursion and induction are fundamental ideas in computer science and mathematics that might be regularly used to solve problems regarding repetitive structures. Recursion is a programming technique in which a function calls itself to solve the problem, whilst induction is a mathematical proof techn 4 min read Like