This category is for logical grouping only. It needn’t to be added directly. Instead, the sub-categories should be added.

## 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 »

## Jagged Array or Array of Arrays in C with Examples

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 »

## Median of an unsorted array using Quick Select Algorithm

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 »

## Max Heap in Python

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 »

## Min Heap in Python

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 »

## Program to build a DFA that accepts strings starting and ending with different character

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 »

## Program to print the given digit in words

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 »

## Duplicates Removal in Array using BST

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 »

## Ternary representation of Cantor set

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 »

## Minimum number of Circular obstacles required to obstruct the path in a Grid

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 »

## Sum of all LCP of maximum length by selecting any two Strings at a time

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 »

## Maximum number of multiples in an array before any element

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 »

## Print all possible combinations of words from Dictionary using Trie

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 »

## Efficiently merging two sorted arrays with O(1) extra space and O(NlogN + MlogM)

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 »