Home » Interview coding problems

# Recursion practice problems with solutions

Recursion practice problems: Here, you will find the various recursion practice problems with solutions that are commonly asked in the various interview rounds of the companies. Each recursion practice problem has its solution with the examples, detailed explanations of the solution approaches.

## List of the recursion practice problems

- Palindromic Array
- Wine selling problem | Find the maximum profit from sale of wines
- Minimum Coin Change | Find minimum number of coins that make a given value
- Egg Dropping Problem
- Maximum path sum in a binary tree
- Minimum number of deletions to make a sorted sequence
- Jumbled Strings
- Count of divisible array
- Maximum Calorie
- Special Keyboard
- Minimal moves to form a string
- Total number of non-decreasing numbers with n digits using dynamic programming
- Minimum Time to Display N Character
- Knapsack with Duplicate Items
- Longest Common Subsequence of three strings
- Minimum steps to minimize n as per given condition
- Count total number of Palindromic Subsequences
- Adjacent are not allowed
- Count number of binary strings without consecutive 1's
- Longest Palindromic Substring
- Count total number of Palindromic Substrings
- Count the number of elements which are greater than previous element
- Print all the combinations of the parenthesis
- Count the combinations of the parenthesis

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.