## Query to check if a range is made up of consecutive elements

Given an array of n non-consecutive integers and Q queries, the task is to check whether for the given range l and r, the elements… Read More »

- Count of triplets that satisfy the given equation
- Write a function to get the intersection point of two Linked Lists | Set 2
- Print nodes having maximum and minimum degrees
- Number of triplets in array having subarray xor equal
- Minimum distance to visit all the nodes of an undirected weighted tree
- Widest Path Problem | Practical application of Dijkstra's Algorithm
- Find maximum count of duplicate nodes in a Binary Search Tree
- Twisted Tower of Hanoi Problem
- Minimum characters that are to be inserted such that no three consecutive characters are same
- Minimum value to be assigned to the elements so that sum becomes greater than initial sum
- Implementation of Non-Preemptive Shortest Job First using Priority Queue
- Sorting Algorithms Visualization | Selection Sort
- Queries to find the left-most given type integer in a binary array
- Van Emde Boas Tree | Set 4 | Deletion
- Difference between Linear and Non-linear Data Structures
- Skewed Binary Tree
- Extended Binary Tree

Given an array of n non-consecutive integers and Q queries, the task is to check whether for the given range l and r, the elements… Read More »

Given a sentence as a string str and a word word, the task is to check if the word is present in str or not.… Read More »

Given an array of rectangular blocks with dimensions {l, b} of length m. we can shape each of rectangular blocks into a single square block… Read More »

Given an array arr[] consisting of even integers. At each move, you can select any even number X from the array and divide all the… Read More »

Given an array arr[] of length N, the task is to find the number of strictly increasing sub-sequences in the given array. Examples: Input: arr[]… Read More »

Given the leaf nodes of a perfect binary tree, the task is to construct the XOR tree and print the root node of this tree.… Read More »

Given an array of integer arr[] and an integer k, the task is to find the median of each window of size k starting from… Read More »

Given two binary strings of equal length, the task is to find the minimum number of swaps to make them equal. Swapping between two characters… Read More »

Given an ancestor matrix mat[n][n] where the ancestor matrix is defined as below. mat[i][j] = 1 if i is ancestor of j mat[i][j] = 0,… Read More »

Given a binary tree, the task is to print left and right leaf nodes separately. Examples: Input: 0 / \ 1 2 / \ 3… Read More »

Given a string str containing only lowercase characters. The problem is to print the characters along with their frequency in the order of their occurrence… Read More »

Given a N x M matrix where N is the number of rows and M is the number of columns in the given matrix and… Read More »

Given a string str, the task is to replace all occurrences of the given X with given Y and also remove any occurrances of the… Read More »

Given a Zero matrix of N x N size, the task is to find the numbers of cells containing even numbers after performing Q queries.… Read More »

Given a binary string, the task is to find whether all the digits of the string can be made equal i.e either 0 or 1… Read More »