## Min Query

Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l, r. We...

Skip to content
## Min Query

## Plagiarism Test

## Sum Query

## Maximum Divisor

## Consecutive Permutation

## XOR Maximum

## Find words

## Tug of War

## Unique Power Set

## Possible Numbers

## Phone Number

## Possible Attack-2

## Grey Code

## Time Bits

## Creating Words

## Possible Attack-1

## M Coloring Problem

## Furious Teacher

## Check SumTree

## Valid Binary Search Tree

## Convert SumTree

## Size of Tree

## Mirror Reflection

## Maximum Turns

## LevelOrder Traversal

## Ancestors

## Inorder Traversal

## Height of Tree

## Maximum Distinct

## Mirror Tree

Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l, r. We...

Concepts Used BFS , Recursion Difficulty Level Easy Problem Statement : Given a binary tree, and a node X, we have to sum all the nodes except the node X....

Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l,r. We have...

Concepts Used Segment Trees, GCD Difficulty Level Medium Problem Statement : Given an array of N elements and Q queries. In each query, two values is given l and r....

Concepts Used Segment Trees Difficulty Level Hard Problem Statement : Given an array of N unique elements and Q queries. In each query, we are given two values l,r. We...

Concepts Used Trie Difficulty Level Medium Problem Statement : Given array of N numbers, we need to find the maximum xor between any pair of the numbers. See original problem...

Concepts Used Trie Difficulty Level Easy Problem Statement : Given a blank dictionary. Now in the first set of operations, you have to insert N integers in the dictionary. And...

Concepts Used Back Tracking Difficulty Level Hard Problem Statement : Given a set of n integers, divide the set in two subsets of n/2 sizes each such that the difference...

Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given N integers print all the distinct power sets of the sequence in lexicographical order. See original problem statement here...

Concepts Used Back Tracking Difficulty Level Easy Problem Statement : Given a string, we have to find total number of different sequences that can be formed using the letters in...

Concepts Used Backtracking Difficulty Level Easy Problem Statement : Given a string containing numeric digits from 2 to 9 inclusive, return all possible letter combinations that the number could represent...

Concepts Used Back Tracking Difficulty Level Hard Problem Statement : Given N integers print all distinct combinations. See original problem statement here Solution Approach : Introduction : Idea is to...

Concepts Used Back Tracking Difficulty Level Hard Problem Statement : Given a non-negative integer n representing the total number of bits , we need to print the sequence of gray...

Concepts Used Back Tracking Difficulty Level Easy Problem Statement : Given n set bits, we have to determine all the time that can be represented by those number of set...

Concepts Used Back Tracking Difficulty Level Hard Problem Statement : Given a matrix of characters with n rows and m columns, and few words. We have to find out if...

Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given N integers print all possible combinations. See original problem statement here Solution Approach : Introduction : Idea is to...

Given an undirected graph and M colors, the problem is to find if it is possible to color the graph with at most M colors or not. See original problem...

Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given N, count all the numbers with unique digits less than 10n. See original problem statement here Solution Approach :...

Concepts Used DFS , Recursion Difficulty Level Hard Problem Statement : "A SumTree is a Binary Tree where the value of a node is equal to sum of the nodes...

Concepts Used DFS , Recursion Difficulty Level Medium Problem Statement : Given a binary tree, determine if it is a valid binary search tree (BST). See original problem statement here...

Concepts Used DFS , Recursion Difficulty Level Medium Problem Statement : Given a binary tree and the task is to convert that tree into SumTree. See original problem statement here...

Concepts Used BFS , Recursion Difficulty Level Easy Problem Statement : Given a binary tree, our task is to print the size of the tree. Size of tree represented as...

Concepts Used DFS , Recursion Difficulty Level Medium Problem Statement : Given two binary trees, we need to find whether one tree in the pair is the mirror image of...

Concepts Used DFS , Recursion Difficulty Level Hard Problem Statement : Given a binary tree, find the path length having maximum number of bends. See original problem statement here Solution...

Concepts Used BFS , Queue Difficulty Level Easy Problem Statement : Given a binary tree, our task is to print the level order traversal of the tree. See original problem...

Concepts Used DFS , Recursion Difficulty Level Medium Problem Statement : "Lowest common ancestor of two node n1 and n2 is the lowest node in the tree that has both...

Concepts Used DFS , Recursion, Stack Difficulty Level Easy Problem Statement : Given a binary tree, our task is to print the inorder traversal of the tree. See original problem...

Concepts Used BFS , Recursion Difficulty Level Easy Problem Statement : Given a binary tree, our task is to print the height of the tree. Consider root node height as...

Concepts Used DFS , Recursion, Hashing Difficulty Level Hard Problem Statement : Given a binary tree, our task is to return the maximum count of distinct integers present in a...

Concepts Used DFS , Recursion, Stack Difficulty Level Medium Problem Statement : Given a Binary Tree, convert it into its mirror. See original problem statement here Solution Approach : Introduction:...