## Construct a sequence from given frequencies of N consecutive integers with unit adjacent difference

Given an array freq[] which stores the frequency of N integers from 0 to N – 1. The task is to construct a sequence where… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Maximum sum path in a Matrix
- Stack of Pair in C++ STL with Examples
- Set of Vectors in C++ STL with Examples
- Queue of Pairs in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Convert Adjacency Matrix to Adjacency List representation of Graph
- Count of subarrays which start and end with the same element
- Real-time application of Data Structures
- Find the string formed by joining k consecutive nodes of linked list
- Kth most frequent Character in a given String
- Program to reverse words in a given string in C++
- Implementing upper_bound() and lower_bound() for Ordered Set in C++
- Longest Mountain Subarray
- What is a Webcrawler and where is it used?
- Count the number of ways to construct the target string
- Reverse an array in groups of given size | Set 3 (Single traversal)
- Count triplets such that sum of any two number is equal to third | Set 2
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- CamelCase Pattern Matching
- Program to find frequency of each element in a vector using map in C++
- Count ways to partition a string such that both parts have equal distinct characters
- Find if there is a path between two vertices in an undirected graph
- Design a Queue data structure to get minimum or maximum in O(1) time
- Paranthesis Theorem
- Shortest path in a directed graph by Dijkstra’s algorithm
- Duplicates Removal in Array using BST
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- XOR of elements in a given range with updates using Fenwick Tree
- Maximum Possible Rating of a Coding Contest

Given an array freq[] which stores the frequency of N integers from 0 to N – 1. The task is to construct a sequence where… Read More »

Given a string str and two characters X and Y, the task is to write a recursive function to replace all occurrences of character X… Read More »

Given an integer array arr[] of size N, the task is to find the minimum distance between any most and least frequent element of the… Read More »

Given an array arr[] of N positive integers where the integers are in the range from 1 to N, the task is to check whether… Read More »

Given an integer N in form of string str consisting of more than 100 digits, the task is to store the value for performing an… Read More »

We all know that Fibonacci numbers (Fn) is defined by the recurrence relation Fibonacci Numbers (Fn) = F(n-1) + F(n-2) with seed values F0 =… Read More »

Given a string, the task is to write Java program to print all the duplicate characters with their frequency Example: Input: str = “geeksforgeeks” Output:… Read More »

Given a Binary Tree, the task is to find the maximum value of Bitwise AND from any path from the root node to the leaf… Read More »

Given a string str and an integer K, the task is to find a string S such that it has exactly K subsequences of given… Read More »

Given an integer array arr[] of size N, the task is to count the total number of distinct pairs having minimum absolute difference. Examples: Input: arr[]… Read More »

Given a large number in the form of a string str and a number K, the task is to check if the number formed by… Read More »

Given a numeric string str, the task is to remove all the leading zeros from a given string. If the string containing only zeros, then… Read More »

Given an array arr[] of N integers, the task is to replace each element of Array with their rank in array. The rank of an… Read More »

Given string str of lower case alphabets, the task is to find the minimum cost to change the input string in a string that contains… Read More »

Given an array arr[] consisting of N positive integers, the task is to print all pairs of array elements whose sum does not exist in… Read More »