Unique Power Set
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...
Possible Numbers
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...
Phone Number
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...
Possible Attack-2
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...
Grey Code
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...
Time Bits
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...
Creating Words
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...
Possible Attack-1
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...
M Coloring Problem
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...
Furious Teacher
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 :...
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...
REORDER LIST
In this article, we will discuss different approaches to reorder linked list. Reordering a linked list will always clear the topic like a linked list. And Having knowledge about linked...
How To Find Pairs With Given Sum In Linked List
This blog will explain how to find pairs with given sum in linked list. Firstly, bruteforce is discussed which helps to figure the quickest solution and the optimized solution is...
QUICK SORT
Concepts Used Qucik sort. Difficulty Level Hard. Problem Statement : You are given a pointer to the head of a linked list. Now the length of the linked list is...
MERGE K SORTED LINKED LISTS
In this blog, we will discuss three different approaches to merge k sorted lists. Merging k sorted linked lists is a challenging topic and conquering it will make your data...
DELETE NODES FROM LINKED LIST
In the Below article, we are trying to delete smaller nodes in linked list and delete larger nodes in linked list. We have seen so many concepts in data structures...
PALINDROME LIST
In this blog, we have to figure out a palindrome linked list. A Palindrome linked list means a Linked List which has values in a palindromic form i.e. values from...
INSERT A NODE
Concepts Used Linked list Difficulty Level Easy Problem Statement : You are given a sorted linked list and you have to insert a node in the list in a sorted...
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...
Size of Tree
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...
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...
Mirror Tree
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:...
Light in night
CONCEPTS USED: Sorting DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A containing N bulbs placed on the road of length L, these bulbs can be placed at any point...