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...
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...
Largest number smaller than or equal to N and digits in non-decreasing order
Concepts Used Strings Difficulty Level Medium Problem Statement (Simplified): For a number given to us, we have to print a number less than or equal to the given number, and...
Sort in a unique way
Concepts Used: Sorting Difficulty Level: Easy Problem Statement (Simplified): For a given array find the length of largest sorted sub-array in it, but if the current array is not sorted,...
GCD of two numbers
Concepts Used: Mathematics Difficulty Level: Easy Problem Statement (Simplified): Print gcd of two given numbers. gcd(m,n) is the largest number possible which divides both. See original problem statement here Test...
How to Find GCD of two very large numbers?
This article will deep dive and discuss how to find gcd of two numbers. Finding a GCD of two numbers will help in developing the basic logical skills and coding...
Sort array containing only 0, 1 and 2 as elements
Concepts Used: Sorting Difficulty Level: Easy Problem Statement (Simplified): We have to print the array containing 0s, 1s and 2s in non-decreasing order. See original problem statement here Test Case:...
Find sum of elements less than A and greater than B in an array
Concepts Used: Sorting Difficulty Level: Medium Problem Statement (Simplified): You're provided an array containing N elements, you have to answer q queries. In each query, you're provided with x and...
Find the misplaced elements
Concepts Used: Sorting Difficulty Level: Easy Problem Statement (Simplified): Find how many elements change their place after sorting array. See original problem statement here Test case: Input: 1 5 8...
Convert Integer number to Roman Number
Concepts Used: Strings Difficulty Level: Medium Problem Statement (Simplified): For a given number between 0 and 4000, print out it's Roman Form. See original problem statement here Test Case: Input:...
Tina loves A
Concepts Used: Strings, Basic Mathematics Difficulty Level: Easy Problem Statement (Simplified): Print the maximum length of string which can be formed such that the number of a is more than...
Minimum Number of Operations to Make String Palindrome
Convert given string into a palindrome by decreasing or increasing characters by their ASCII value, in minimum number of operations. Each decrement or increment is considered as one opeartion. Print...