## Count of smaller elements on right side of each element in an Array using Merge sort

Given an array arr[] of N integers, the task is to count the number of smaller elements on the right side for each of the… Read More »

- Live Classes for Data Structures and Algorithms: Interview Preparation Focused Course
- Playfair Cipher with Examples
- Count of triplets that satisfy the given equation
- Maximum Sequence Length | Collatz Conjecture
- Implementation of BFS using adjacency matrix
- Find a pair (n,r) in an integer array such that value of nPr is maximum
- Minimum increment or decrement operations required to make the array sorted
- Maximum XOR of Two Numbers in an Array
- Check if the rows of a binary matrix can be made unique by removing a single column
- Longest Increasing Subsequence using Longest Common Subsequence Algorithm
- Color all boxes in line such that every M consecutive boxes are unique
- Count the number of elements which are greater than any of element on right side of an array
- Count all substrings having character K
- Count of triples (A, B, C) where A*C is greater than B*B
- Minimum increment operations to make K elements equal
- Maximise the number of toys that can be purchased with amount K using min Heap
- Number of sub arrays with negative product
- Minimize the cost of partitioning an array into K groups
- Find a pair (n,r) in an integer array such that value of nCr is maximum
- Minimum distance to visit all the nodes of an undirected weighted tree
- Widest Path Problem | Practical application of Dijkstra's Algorithm
- Count the values greater than X in the modified array
- Maximize the Expression | Bit Manipulation
- Maximum non-attacking Knights that can be placed on an N*M Chessboard
- Sum of absolute differences of pairs from the given array that satisfy the given condition
- Expand the string according to the given conditions
- Comparing X^Y and Y^X for very large values of X and Y
- Implementation of DFS using adjacency matrix
- Find all numbers between range L to R such that sum of digit and sum of square of digit is prime
- Minimum number of additons to make the string balanced

Given an array arr[] of N integers, the task is to count the number of smaller elements on the right side for each of the… Read More »

Prerequisite: Van Eck’s sequence Given a positive integer N, the task is to count the occurrences of Nth term in first N terms of Van… Read More »

Given an integer array arr and a number K, the task is to find the length of longest subarray such that all the elements in… Read More »

Given two strings A and B consisting of only lowercase letters, the task is to find the minimum number of subsequences required from A to… Read More »

Given N eggs and K floors, the task is to find the minimum number of trials needed in the worst case to find the floor… Read More »

In this article, it is explained how to find the X, Y and Z intercepts of a plane. There are two ways to find the… Read More »

Given two numbers N and S, the task is to find the length of smallest subarray in range (1, N) such that the sum of… Read More »

Given a directed graph with N nodes and E edges where the weight of each of the edge is > 1, also given a source… Read More »

Given a directed weighted graph and two vertices S and D in it, the task is to find the shortest path from S to D… Read More »

Given integers S, N, K, L and R where S has to be distributed in an array of size N such that each element must… Read More »

Given an integer N, the task is to find the next number with distinct digits in it. Examples: Input: N = 20 Output: 21 The… Read More »

Given two array X[] and H[] of length N and M respectively, the task is to find the circular convolution of the given arrays using… Read More »

Given an array arr[], the task is to remove at most one element and calculate the maximum length of strictly increasing subarray. Examples: Input: arr[]… Read More »

Given an integer C, the task is to find the minimum possible value of max(A, B) such that LCM(A, B) = C. Examples: Input: C… Read More »

Given a string str, the task is to find the maximum length K such that there exist two sub-sequences A and B each of length… Read More »