## Construct a string that has exactly K subsequences from given string

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 »

- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Count of subarrays having exactly K perfect square numbers
- Check if given words are present in a string
- Kth most frequent Character in a given String
- Sorting a Map by value in C++ STL
- LRU Cache in Python using OrderedDict
- Length of the smallest substring which contains all vowels
- Longest permutation subsequence in a given array
- Remove odd frequency characters from the string
- Real-time application of Data Structures
- Count triplets such that sum of any two number is equal to third | Set 2
- CamelCase Pattern Matching
- Count of substrings of length K with exactly K distinct characters
- Longest increasing sub-sequence formed by concatenating array to itself N times
- Count the elements having frequency equals to its value
- Check if an Array is a permutation of numbers from 1 to N
- Count of greater elements for each element in the Array
- Count of subarrays whose sum is a perfect square
- Count triplets in an array such that i<j<k and a[j] - a[i] = a[k] - a[j] = D
- Shortest subarray to be removed to make all Array elements unique
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Minimum number of Water to Land conversion to make two islands connected in a Grid
- Program to implement Separate Chaining in C++ STL without the use of pointers
- Count numbers divisible by K in a range with Fibonacci digit sum for Q queries
- Array range queries to count the number of Fibonacci numbers with updates
- Remove duplicates from string keeping the order according to last occurrences
- Largest lexicographical string with at most K consecutive elements
- Maximum sum subarray having sum less than or equal to given sum using Set
- Length of longest subsequence of Fibonacci Numbers in an Array
- Minimum number of swaps required to make the string K periodic

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

HashMap is a class that implements the Map interface of Java Collections Framework. The most important feature of a HashMap is that it has a… Read More »

Given an array of strings arr[] containing N words, the task is to print all possible palindromic string by combining any two strings from the… Read More »

Given a string S and an integer K, the task is to check if it is possible to distribute these characters into two strings such… Read More »

Given an array arr[] consisting of N integers, the task is to find the start and end indices of the first subarray with a Negative… Read More »

Given two arrays A[] and B[] consisting of N positive integers and a integer M, the task is to find the minimum value of X… Read More »

Given a string S, the task is to find the number of ways to split the given string S into two non-empty palindromic strings. Examples:… Read More »

Given an array arr[] of size N, and Q queries of the form {i, k} for which, the task is to print the most frequent… Read More »

Given an array arr[] of N integers, the task is to find the maximum absolute difference between distinct elements of the array. Examples: Input: arr[]… Read More »

Given an array arr[] of N integers, the task is to find the size of largest subarray with frequency of all elements same. Examples: Input:… Read More »

Given an array arr[] of length N, the task is to print the number of array elements which cannot form a pair with any other… Read More »

Hashing is a technique that uses fewer key comparisons and searches the element in O(n) time in the worst case and in O(1) time in… Read More »

Given an array of integers, we need to print k most frequent elements. If there is a tie, we need to prefer the elements whose… Read More »