Get free ebooK with 50 must do coding Question for Product Based Companies solved
Fill the details & get ebook over email
Thank You!
We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

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...

Plagiarism Test

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....

Check SumTree

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...

Valid Binary Search Tree

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...

Convert SumTree

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...

Mirror Reflection

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...

Maximum Turns

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...

LevelOrder Traversal

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...

Ancestors

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...

Inorder Traversal

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...

Height of Tree

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...

Maximum Distinct

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...

Student Marks

Concepts Used Queue, Basic Implementation Difficulty Level Easy Problem Statement : You are given a binary tree, you need to print the average of each level of the tree. See...