Total number of possible Binary Search Trees using Catalan Number
Given an integer N, the task is to count the number of possible Binary Search Trees with N keys. Examples: Input: N = 2 Output:… Read More »
Category Archives: Recursion
Find the node with maximum value in a Binary Search Tree using recursion
Given a Binary Search Tree, the task is to find the node with maximum value. Examples: Input: Output: 22 Recommended: Please try your approach on… Read More »
Maximum sum of non-overlapping subarrays of length atmost K
Given an integer array ‘arr’ of length N and an integer ‘k’, select some non-overlapping subarrays such that each sub-array if of length at most… Read More »
Merge two BSTs with constant extra space
Given two Binary Search Trees(BST), print the elements of both BSTs in sorted form. Note: Both the BSTs will not have any common element. Examples:… Read More »
Number of ways to choose elements from the array such that their average is K
Given an array arr[] of N integers and an integer K. The task is to find the number of ways to select one or more… Read More »
Subset with sum closest to zero
Given an array ‘arr’ consisting of integers, the task is to find the non-empty subset such that its sum is closest to zero i.e. absolute… Read More »
Minimize the sum after choosing elements from the given three arrays
Given three arrays A[], B[] and C[] of same size N. The task is to minimize the sum after choosing N elements from these array… Read More »
Maximise array sum after taking non-overlapping sub-arrays of length K
Given an integer array arr[] of length N and an integer K, the task is to select some non-overlapping sub-arrays such that each sub-array is… Read More »
Paths from entry to exit in matrix and maximum path sum
Given a maze which is a N * N grid grid[][]. Every cell of the maze contains either the number 1, 2 or 3 which… Read More »
Factorial of an Array of integers
Given an array with positive integers. The task is to find the factorial of all the array elements. Note: As the numbers would be very… Read More »
Find maximum topics to prepare in order to pass the exam
Given three integer n, h and p where n is the number of topics, h is the time left (in hours) and p is the… Read More »
Algorithms Sample Questions | Set 3 | Time Order Analysis
Question 1: What is the asymptotic boundary of T(n)? θ( n*log(n) ) θ( n2 ) θ( n ) θ( n*log2(n) ) θ( n2*log2(n) ) Answer:… Read More »
Program to Calculate e^x by Recursion
The value of Exponential function can be calculated using Taylor Series. = 1 + x/1! + /2! + /3! + …… To find its value… Read More »
Algorithms Sample Questions | Recurrences | Set 2
Question 1: What is the complexity of T(n)? Θ( 1⁄n ) Θ( 1⁄n2 ) Θ( 1 ) Θ( ln( n ) ) Answer: 3 Explanation:… Read More »
Number of subsets with zero sum
Given an array ‘arr’ consisting of integers, the task is to find the number of subsets such that their sum is equal to zero. Empty… Read More »
