Recursion practice problems with solutions

To quote Wikipedia,

Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed to iteration).

Recursion is very important concept in computer science and one just cannot neglect this topic. True, it can be very confusing and difficult to understand, especially for the beginners but once you understand this topic, it opens a whole new world for you. Recursion just takes practice to get good at and nothing is more interesting than finding a solution to a problem “recursive” way.


Backtracking –


Strings –


Array –


Matrix –


Divide & Conquer –


Linked List –


Graphs –


Sorting –


Heap –


Binary Tree –

  • Check if two binary trees are identical or not | Iterative & Recursive
  • Calculate height of binary tree | Iterative & Recursive
  • Delete given Binary Tree | Iterative & Recursive
  • Level Order Traversal of Binary Tree
  • Spiral Order Traversal of Binary Tree
  • Reverse Level Order Traversal of Binary Tree
  • Print left view of binary tree
  • Print Bottom View of Binary Tree
  • Print Top View of Binary Tree
  • Find next node in same level for given node in a binary tree
  • Check if given binary tree is complete binary tree or not
  • Determine if given two nodes are cousins of each other
  • Print cousins of given node in a binary tree
  • In-place convert given binary tree to its sum tree
  • Check if given binary tree is a sum tree or not
  • Combinations of words formed by replacing given numbers with corresponding alphabets
  • Determine if given binary tree is a subtree of another binary tree or not
  • Find diameter of a binary tree
  • Check if given binary Tree is symmetric or not
  • Convert binary tree to its mirror
  • Check if tree can be converted to another by doing any no. of swaps of left & right child
  • Postorder Tree Traversal | Iterative & Recursive
  • Preorder Tree Traversal | Iterative & Recursive
  • Inorder Tree Traversal | Iterative & Recursive
  • Find Lowest Common Ancestor (LCA) of two nodes in a binary tree
  • Print all paths from root to leaf nodes in given binary tree
  • Find ancestors of given node in a Binary Tree
  • Find the distance between given pairs of nodes in a binary tree
  • Find Vertical Sum in a given Binary Tree
  • Print nodes in vertical order of a given Binary Tree (Vertical Traversal)
  • Find the diagonal sum of given binary tree
  • Print Diagonal Traversal of Binary Tree
  • In-place convert convert given Binary Tree to Doubly Linked List
  • Sink nodes containing zero to the bottom of the binary tree
  • Convert given binary tree to full tree by removing half nodes
  • Truncate given binary tree to remove nodes which lie on a path having sum less than K
  • Find maximum sum root to leaf path in a binary tree
  • Check if given binary tree is height balanced or not
  • Convert normal binary tree to Left-child right-sibling binary tree
  • Trie Implementation | Insert, Search and Delete

    Binary Search Tree –


    Dynamic Programming –

  • Longest Common Subsequence | Introduction & LCS Length
  • Longest Common Subsequence | Finding all LCS
  • Longest Common Subsequence of K-sequences
  • Longest Palindromic Subsequence using Dynamic Programming
  • Longest Repeated Subsequence problem
  • Shortest Common Supersequence | Introduction & SCS Length
  • Shortest Common Supersequence | Finding all SCS
  • Longest Increasing Subsequence using Dynamic Programming
  • Increasing Subsequence with Maximum Sum
  • The Levenshtein distance (Edit distance) problem
  • Find size of largest square sub-matrix of 1’s present in given binary matrix
  • Matrix Chain Multiplication
  • Find the minimum cost to reach last cell of the matrix from its first cell
  • Find longest sequence formed by adjacent numbers in the matrix
  • Count number of paths in a matrix with given cost to reach destination cell
  • 0-1 Knapsack problem
  • Partition problem
  • Subset sum problem
  • Minimum Sum Partition problem
  • Find all N-digit binary strings without any consecutive 1’s
  • Rod Cutting
  • Maximum Product Rod Cutting
  • Coin change-making problem (unlimited supply of coins)
  • Coin Change Problem (Total number of ways to get the denomination of coins)
  • Longest alternating subsequence
  • Count number of times a pattern appears in given string as a subsequence
  • Collect maximum points in a matrix by satisfying given constraints
  • Find optimal cost to construct Binary Search Tree
  • Word Break Problem
  • Wildcard Pattern Matching

    Programming puzzles –



    Thank you all for your valuable time and being with us. 🙂