Find all increasing subsequences of an array
Given an integer array, find all distinct increasing subsequences of length two or more.
Tag: Recursive
Count distinct permutations of an array that sums to a target
Given an array of distinct positive integers, find the total number of distinct permutations that add up to a given target, where each array element may be used any number of times.
Calculate sum of root to leaf digits in a binary tree
Given a binary tree, where each node stores a value between 0 and 9, calculate the sum of the numbers created by the paths from root to leaf.
Remove all nodes from a linked list that matches a given key
Given a linked list, remove all nodes from it that match a given key.
Find all distinct combinations of a given length that sum to a target
Given a positive integer n and a target, find all combinations of distinct numbers in the interval [1,9] of length n that add up to the target.
Count paths with the given sum in a binary tree
Given a binary tree and an integer k, count the total number of paths in the tree whose sum of all nodes is equal to k.
Shrink an array by removing triplets that satisfy given constraints
Given an integer array, shrink it by removing adjacent triplets that satisfy the given constraints and return the total number of elements in the resultant array.
Count nodes in a BST that lies within a given range
Given a BST, count the total number of nodes that lie within a given range.
Check whether a directed graph is Eulerian
An Eulerian trail (or Eulerian path) is a path in a graph that visits every edge exactly once. Given a directed graph, check whether it has an Eulerian path or not.
Construct a complete binary tree from its linked list representation
Given a linked list, construct a complete binary tree from it. Assume that the order of elements present in the linked list is the same as that in the complete tree’s array representation.
Check if removing an edge can split a binary tree into two equal size trees
Given a binary tree, check if removing an edge can split it into two binary trees of equal size.
In-place merge two height-balanced BSTs
Given two height-balanced binary search trees, in-place merge them into a single balanced binary search tree. For each node of a height-balanced tree, the difference between its left and right subtree height is at most 1.