## Check whether the two Binary Search trees are Identical or not?

Given the root nodes of the two binary search trees. The task is to print 1 if the two Binary Search Trees are identical else… Read More »

- How can one become good at Data structures and Algorithms easily?
- Load Factor and Rehashing
- Sum of cousins of a given node in a Binary Tree
- Implementing a Linked List in Java using Class
- Insert a node at a specific position in a linked list
- Rat in a Maze | Backtracking using Stack
- Maximize the total profit of all the persons
- Sort the array of strings according to alphabetical order defined by another string
- Find the node with maximum value in a Binary Search Tree
- Number of array elements derivable from D after performing certain operations
- Remove last node of the linked list
- Print all nodes between two given levels in Binary Tree
- Applications of Graph Data Structure
- Sum of all the elements in an array divisible by a given number K
- Number of sub-strings which are anagram of any sub-string of another string
- Find the maximum node at a given level in a binary tree
- Delete all the even nodes from a Doubly Linked List
- Fibonacci Heap - Deletion, Extract min and Decrease key
- Print all odd nodes of Binary Search Tree
- Subtree of all nodes in a tree using DFS
- How do Dynamic arrays work?
- Sum and Product of minimum and maximum element of Binary Search Tree
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Find maximum among all right nodes in Binary Tree
- Check if the elements of stack are pairwise sorted
- Find the product of last N nodes of the given Linked List
- Check whether the two Binary Search Trees are Identical or Not
- Product of all nodes in a Binary Tree
- Root to leaf path product equal to a given number
- Sum and Product of the nodes of a Circular Singly Linked List which are divisible by K

Given the root nodes of the two binary search trees. The task is to print 1 if the two Binary Search Trees are identical else… Read More »

A Levelwise GCD/LCM alternating segment tree is a segment tree, such that at every level the operations GCD and LCM alternate. In other words at… Read More »

Given a binary tree where each node can have at most two child nodes, the task is to find the Euler tour of the binary… Read More »

A hotel manager has to process N advance bookings of rooms for the next season. His hotel has K rooms. Bookings contain an arrival date… Read More »

Given a queue of integers of even length, rearrange the elements by interleaving the first half of the queue with the second half of the… Read More »

Pre-requisite : set in C++, unordered_set in C++ Differences : | set | unordered_set ——————————————————— Ordering | increasing order | no ordering | (by default)… Read More »

Given an array a[] of n elements. The task is to find the array (say b[]) of n + 1 such that Greatest Common Divisor… Read More »

We are given a read only array of n integers. Find any element that appears more than n/3 times in the array in linear time… Read More »

In this post we will compare Red Black Tree and AVL Tree. Red Black Tree: Properties: Self-Balancing is provided by painting each node with one… Read More »

Given an array, find the maximum difference between its two consecutive elements in its sorted form. Examples: Input : arr[] = {1, 10, 5} Output… Read More »

Given a Binary Circular Array of size N elements and two positive integers x and y indicating the indices in the circular array. The task… Read More »

Given an array A[] of n elements and an integer k. The task is to find the number of triplet (x, y, k), where 0… Read More »

A 10 x 10 Crossword grid is provided, along with a set of words (or names of places) which need to be filled into the… Read More »

Given two strings s1 and s2, check if s1 is a suffix of s2. Or in simple words we need to find whether string s2… Read More »

Given an array of positive integer and q query which contains two integers, L & R. Task is to find the number of set bits… Read More »