Print path between any two nodes in a Binary Tree | Set 2
Given a Binary Tree of distinct nodes and a pair of nodes. The task is to find and print the path between the two given… Read More »
Category Archives: Data Structures
Number of subsequences in a given binary string divisible by 2
Given a binary string str of length N, the task is to find the count of subsequences of str which are divisible by 2. Leading… Read More »
Minimum count of Full Binary Trees such that the count of leaves is N
Given an integer N and an infinite number of Full Binary Trees of different depths, the task is to choose minimum number of trees such… Read More »
Maximize the profit after selling the tickets
Given an array seats[] where seat[i] is the number of vacant seats in the ith row in a stadium for a cricket match. There are… Read More »
Find whether X exists in Y after jumbling X
Given two strings X and Y containing lower-case alphabets, the task is to check whether any permutation of string X exists in Y as its… Read More »
Largest number dividing maximum number of elements in the array
Given an array arr[] of length N, the task is to find the largest number dividing the maximum number of elements from the array. Examples:… Read More »
Knapsack with large Weights
Given a knapsack with capacity C and two arrays w[] and val[] representing the weights and values of N distinct items, the task is to… Read More »
Remove all the prime numbers from the given array
Given an array arr[] of N integers, the task is to remove all the prime numbers. Examples: Input: arr[] = {4, 6, 5, 3, 8,… Read More »
Reverse substrings between each pair of parenthesis
Given a string str that consists of lower case English letters and brackets. The task is to reverse the substrings in each pair of matching… Read More »
Remove one element to get minimum OR value
Given an array arr[] of N elements, the task is to remove one element from the array such that the OR value of the array… Read More »
Difference between Binary tree and B-tree
B-Tree : B-Tree is known as self-balancing tree as its nodes are sorted in inorder traversal. Unlike binary tree, in B-tree, a node can have… Read More »
Sum of lengths of all paths possible in a given tree
Given a tree with N nodes, the task is to find the sum of lengths of all the paths. Path length for two nodes in… Read More »
Perform append, update, delete and range sum queries on the given array
Given an array arr[] of size N and the task is to answer Q queries of the following types: 1 X 0: Append X at… Read More »
Value to be subtracted from array elements to make sum of all elements equals K
Given an integer K and an array height[] where height[i] denotes the height of the ith tree in a forest. The task is to make… Read More »
Queries to check if the path between two nodes in a tree is a palindrome
Given a tree with N nodes and N – 1 edges. Each edge of the tree is labeled by a string of lowercase english alphabets.… Read More »
