## Count of Subarrays in an array containing numbers from 1 to the length of subarray

Given an array arr[] of length N containing all elements from 1 to N, the task is to find the number of sub-arrays that contains… 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 arr[] of length N containing all elements from 1 to N, the task is to find the number of sub-arrays that contains… Read More »

Prerequisite: Arrays in C Jagged array is array of arrays such that member arrays can be of different sizes, i.e., we can create a 2-D… Read More »

Given an unsorted array arr[] of length N, the task is to find the median of of this array. Median of a sorted array of… Read More »

A Max-Heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the… Read More »

A Min-Heap is a complete binary tree in which the value in each internal node is smaller than or equal to the values in the… Read More »

Prerequisite: Deterministic Finite Automata Given a string str consists of characters ‘a’ & ‘b’. The task is to check whether string str starts and ends… Read More »

Given a number N, the task is to convert every digit of the number into words. Examples: Input: N = 1234 Output: One Two Three… Read More »

Prerequisite: Graph and its representations Given a adjacency matrix representation of a Graph. The task is to convert the given Adjacency Matrix to Adjacency List… Read More »

Given an array arr[] of integers, the task is to remove duplicates from the given array. Examples: Input: arr[] = {1, 2, 3, 2, 5,… Read More »

Given three integers A, B and L, the task is to print the ternary cantor set from range [A, B] upto L levels. Ternary Cantor… Read More »

Consider a grid of dimensions NxM and an array R consisting of available circular obstacles, the task is to find the minimum number of circular… Read More »

Given a list of strings, the task is to find the sum of all LCP (Longest Common Prefix) of maximum length by selecting any two… Read More »

Given an array arr[], the task is to find the maximum number of indices j < i such that (arr[j] % arr[i]) = 0 among… Read More »

Given an array of strings arr[], for every string in the array, print all possible combinations of strings that can be concatenated to make that… Read More »

Given two sorted arrays arr1[] and arr2[], the task is to merge them in O(Nlog(N) + Mlog(M)) time with O(1) extra space into a sorted… Read More »