Given a Binary Tree, the task is to find the sum of all the specially balanced nodes in the given Binary Tree. A specially balanced… Read More

# Category Archives: Searching

Given a Binary Tree, the task is to print the middle nodes of each level of a binary tree. Considering M to be the number… Read More

Given an array arr[] of distinct integers of size N, the task is to print the count of greater elements on the left side of… Read More

Given an array arr[] of size N, the task is to print the least possible size the given array can be reduced to by performing… Read More

Given an array arr[] consisting of N integers, the task is to find the maximum Bitwise XOR from all the possible pairs in the given… Read More

Given string str, the task is to check if it is possible to split the given string S into three palindromic substrings or not. If… Read More

Given an integer K and a numeric string str, the task is to find the longest subsequence from the given string which is divisible by… Read More

Given an array arr[] consisting of N strings and an array Query[] consisting of Q queries. Each string in arrays arr[] and Query[] is of… Read More

Given a boolean matrix mat[][] of size M * N, the task is to print the count of indices from the matrix whose corresponding row… Read More

Given a 2D array arr[][] consisting of N pairs of integers, the task is to find the pair which covers all other pairs of the… Read More

Given a N-ary Tree consisting of nodes valued in the range [0, N – 1] and an array arr[] where each node i is associated… Read More

Given a graph G consisting of nodes valued [0, N – 1], a source S, and an array Edges[][3] of type {u, v, w} that… Read More

Given a weighted undirected graph T consisting of nodes valued [0, N – 1] and an array Edges[][3] of type {u, v, w} that denotes… Read More