Skip to content

PrepBytes Blog

ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING

Menu
  • Language
    • C
    • C++
    • Java
    • Javascript
    • Python
  • Data Structure
    • Array
    • Graphs
    • Heap
    • Linked List
    • Segment Tree
    • Stack
    • Trees
    • Queue
  • Algorithm
    • Backtracking
    • Dynamic Programming
    • Greedy Algorithm
    • Searching
    • Sorting
  • CSE Subjects
    • Operating System
  • Company Placement
  • Interview
    • Interview Tips
    • General Interview Questions
    • Algorithms
    • Data Structure
    • Languages
    • Other Topics
  • Competitive
    • Data Structure
      • Array
      • Graph
      • Heap
      • Segment Tree
      • Stack
      • Queue
      • Tree
      • Tries
    • Algorithm
      • Backtracking
      • Dynamic Programming
      • Greedy Algorithm
      • Searching
      • Sorting
    • Other Topics
      • Computational Geometry
      • Game Theory
      • Maths
      • Pointers
      • Recursion
      • String
  • Others
    • Computational Geometry
    • Game Theory
    • Hashing
    • Maths
    • Pointers
    • Recursion
    • String

harsh

Trees Interview Questions

Min Query

HarshJuly 27, 2020April 8, 2022
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...
Trees Interview Questions

Plagiarism Test

HarshJune 22, 2020March 30, 2022
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....
Segment Tree Competitive Coding

Sum Query

HarshJune 15, 2020March 31, 2022
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...
Segment Tree Competitive Coding

Maximum Divisor

HarshJune 15, 2020March 11, 2022
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....
Segment Tree Competitive Coding

Consecutive Permutation

HarshJune 15, 2020May 23, 2022
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...
Tries Interview Questions

XOR Maximum

HarshJune 15, 2020March 23, 2022
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...
Tries Interview Questions

Find words

HarshJune 15, 2020March 28, 2022
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...
Backtracking Interview Questions

Tug of War

HarshJune 15, 2020March 23, 2022
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...
Backtracking Interview Questions

Unique Power Set

HarshJune 14, 2020May 17, 2022
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...
Backtracking Interview Questions

Possible Numbers

HarshJune 14, 2020May 17, 2022
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...
Backtracking Interview Questions

Phone Number

HarshJune 14, 2020March 30, 2022
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...
Backtracking Interview Questions

Possible Attack-2

HarshJune 14, 2020March 22, 2022
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...
Backtracking Interview Questions

Grey Code

HarshJune 14, 2020March 28, 2022
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...
Backtracking Interview Questions

Time Bits

HarshJune 14, 2020May 18, 2022
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...
Backtracking Competitive Questions

Creating Words

HarshJune 14, 2020March 28, 2022
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...
Backtracking Interview Questions

Possible Attack-1

HarshJune 12, 2020March 22, 2022
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...
Backtracking Interview Questions

M-Coloring Problem

HarshJune 12, 2020May 17, 2022
Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given an undirected graph and M colors, the problem is to find if it is possible to color the graph...
Backtracking Interview Questions

Furious Teacher

HarshJune 12, 2020March 28, 2022
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 :...
Trees Interview Questions

Check SumTree

HarshJune 12, 2020March 28, 2022
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...
Trees Interview Questions

Valid Binary Search Tree

HarshJune 11, 2020March 23, 2022
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...
Trees Interview Questions

Convert SumTree

HarshJune 11, 2020March 28, 2022
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...
Trees Competitive Questions

Size of Tree

HarshJune 11, 2020March 25, 2022
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...
Trees Interview Questions

Mirror Reflection

HarshJune 11, 2020March 30, 2022
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...
Trees Interview Questions

Maximum Turns

HarshJune 11, 2020March 23, 2022
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...
Trees Interview Questions

LevelOrder Traversal

HarshJune 11, 2020March 29, 2022
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...
Trees Interview Questions

Ancestors

HarshJune 11, 2020March 28, 2022
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...
Trees Interview Questions

Inorder Traversal

HarshJune 11, 2020March 28, 2022
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...
Trees Interview Questions

Height of Tree

HarshJune 11, 2020March 23, 2022
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...
Trees Interview Questions

Maximum Distinct

HarshJune 11, 2020March 29, 2022
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...
Trees Competitive Questions

Mirror Tree

HarshJune 11, 2020May 13, 2022
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:...

Posts navigation

1 2 3 Next

Categories

Pages

  • #8536 (no title)
  • ACCENTURE
  • ADOBE
  • ALGORITHMS
  • AMDOCS
  • APPLE
  • ARRAY
  • ARRAY COMPETITIVE CODING QUESTIONS
  • ARRAY INTERVIEW QUESTIONS
  • BACKTRACKING
  • BACKTRACKING COMPETITIVE CODING QUESTIONS
  • BACKTRACKING INTERVIEW QUESTIONS
  • BYJU’S
  • C INTERVIEW QUESTIONS
  • C PROGRAMMING LANGUAGE
  • C++ INTERVIEW QUESTIONS
  • C++ PROGRAMMING LANGUAGE
  • COMPANY PLACEMENT PROCEDURE
  • COMPETITIVE CODING
  • COMPUTATIONAL GEOMETRY
  • COMPUTATIONAL GEOMETRY COMPETITIVE CODING QUESTIONS
  • CSE SUBJECTS
  • DATA STRUCTURE
  • DELL
  • DESHAW
  • DYNAMIC PROGRAMMING
  • DYNAMIC PROGRAMMING COMPETITIVE CODING QUESTIONS
  • DYNAMIC PROGRAMMING INTERVIEW QUESTIONS
  • FACEBOOK
  • FLIPKART
  • GAME THEORY
  • GAME THEORY COMPETITIVE CODING QUESTIONS
  • General Interview Questions
  • GOLDMAN SACHS
  • GOOGLE
  • GRAPH COMPETITIVE CODING QUESTIONS
  • GRAPH INTERVIEW QUESTIONS
  • GRAPHS
  • GREEDY ALGORITHM
  • GREEDY ALGORITHM COMPETITIVE CODING QUESTIONS
  • GREEDY ALGORITHM INTERVIEW QUESTIONS
  • HASHING
  • HCL
  • HEAP
  • HEAP COMPETITIVE CODING QUESTIONS
  • HEAP INTERVIEW QUESTIONS
  • INFOSYS
  • INTERVIEW PREPARATION
  • INTERVIEW TIPS
  • INTUIT
  • JAVA INTERVIEW QUESTIONS
  • JAVA PROGRAMMING LANGUAGE
  • JAVASCRIPT PROGRAMMING LANGUAGE
  • JUSPAY
  • LINKED LIST
  • LINKED LIST INTERVIEW QUESTIONS
  • MAHINDRA COMVIVA
  • MAKEMYTRIP
  • MATHEMATICS
  • MATHEMATICS COMPETITIVE CODING QUESTIONS
  • MATHEMATICS INTERVIEW QUESTIONS
  • MICROSOFT
  • NAGARRO
  • OPERATING SYSTEM
  • ORACLE
  • OTHER TOPICS
  • PAYTM
  • Pin Posts
  • POINTERS
  • POINTERS COMPETITIVE CODING QUESTIONS
  • PROGRAMMING LANGUAGE
  • PYTHON PROGRAMMING LANGUAGE
  • QUALCOMM
  • QUEUE
  • QUEUE COMPETITIVE CODING QUESTIONS
  • QUEUE INTERVIEW QUESTIONS
  • RECURSION
  • RECURSION COMPETITIVE CODING QUESTIONS
  • RECURSION INTERVIEW QUESTIONS
  • SAMSUNG
  • SAP LABS
  • SEARCHING
  • SEARCHING COMPETITIVE CODING QUESTIONS
  • SEARCHING INTERVIEW QUESTIONS
  • SEGMENT TREE
  • SEGMENT TREE COMPETITIVE CODING QUESTIONS
  • SEGMENT TREE INTERVIEW QUESTIONS
  • SORTING
  • SORTING COMPETITIVE CODING QUESTIONS
  • SORTING INTERVIEW QUESTIONS
  • STACK
  • STACK COMPETITIVE CODING QUESTIONS
  • STACK INTERVIEW QUESTIONS
  • STRING
  • STRING COMPETITIVE CODING QUESTIONS
  • STRING INTERVIEW QUESTIONS
  • TCS
  • TREE COMPETITIVE CODING QUESTIONS
  • TREE INTERVIEW QUESTIONS
  • TREES
  • TRIES COMPETITIVE CODING QUESTIONS
  • WIPRO
  • ZOHO CORP
Close
Menu
  • Language
    • C
    • C++
    • Java
    • Javascript
    • Python
  • Data Structure
    • Array
    • Graphs
    • Heap
    • Linked List
    • Segment Tree
    • Stack
    • Trees
    • Queue
  • Algorithm
    • Backtracking
    • Dynamic Programming
    • Greedy Algorithm
    • Searching
    • Sorting
  • CSE Subjects
    • Operating System
  • Company Placement
  • Interview
    • Interview Tips
    • General Interview Questions
    • Algorithms
    • Data Structure
    • Languages
    • Other Topics
  • Competitive
    • Data Structure
      • Array
      • Graph
      • Heap
      • Segment Tree
      • Stack
      • Queue
      • Tree
      • Tries
    • Algorithm
      • Backtracking
      • Dynamic Programming
      • Greedy Algorithm
      • Searching
      • Sorting
    • Other Topics
      • Computational Geometry
      • Game Theory
      • Maths
      • Pointers
      • Recursion
      • String
  • Others
    • Computational Geometry
    • Game Theory
    • Hashing
    • Maths
    • Pointers
    • Recursion
    • String
FOLLOW US
CONTACT US
+91-8800 2588 17
contact@prepbytes.com
QUICK LINKS
Interview NotesMock TestsPlacement ProgrammeCoding CoursesMock InterviewAbout UsBlog