## Count of distinct substrings of a given string using Rabin Karp Algorithm

Given a string str, the task is to count the number of distinct substrings of the given string using Rabin Karp Algorithm. Examples Input: str… 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
- Sorting a Map by value in C++ STL
- Kth most frequent Character in a given String
- Real-time application of Data Structures
- LRU Cache in Python using OrderedDict
- Length of the smallest substring which contains all vowels
- Longest permutation subsequence in a given array
- Count of substrings of length K with exactly K distinct characters
- Count triplets such that sum of any two number is equal to third | Set 2
- Remove odd frequency characters from the string
- CamelCase Pattern Matching
- Longest increasing sub-sequence formed by concatenating array to itself N times
- Check if an Array is a permutation of numbers from 1 to N
- Count the elements having frequency equals to its value
- 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
- Minimum number of Water to Land conversion to make two islands connected in a Grid
- Sum and product of K smallest and largest Fibonacci numbers in the array
- 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
- Remove duplicates from string keeping the order according to last occurrences
- Array range queries to count the number of Fibonacci numbers with updates
- Maximum sum subarray having sum less than or equal to given sum using Set
- Largest lexicographical string with at most K consecutive elements
- Length of longest subsequence of Fibonacci Numbers in an Array
- Quadratic Probing in Hashing

Given a string str, the task is to count the number of distinct substrings of the given string using Rabin Karp Algorithm. Examples Input: str… Read More »

Given an array arr[] representing a list of prime factors of a given number, the task is to find the product of divisors of that… Read More »

Given an array arr[] and integer K, the task is to split the array into subsets of size K, such that each subset consists of… Read More »

Given a number in form of string str and an integer K, the task is to find the smallest integer that can be formed after… Read More »

Given a string s and an integer X, our task is to find the number of distinct palindromic strings of length X from the given… Read More »

Given an array arr[] of N strings and an integer K, the task is to print K strings which occurred the most number of times… 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 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 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 »