## Print all the sum pairs which occur maximum number of times

Given an array arr[] of N distinct integers. The task is to find the sum of two array integers a[i] + a[j] which occurs maximum… Read More »

- Find the longest string that can be made up of other strings from the array
- Rearrange characters in a string such that no two adjacent are same using hashing
- Flip minimum signs of array elements to get minimum sum of positive elements possible
- Split the array elements into strictly increasing and decreasing sequence
- Count duplicates in a given linked list
- Find uncommon characters of the two strings | Set 2
- Design a stack which can give maximum frequency element
- Count equal pairs from given string arrays
- Minimum number of given operations required to convert a permutation into an identity permutation
- Remove all occurrences of any element for maximum array sum
- Minimum Bitwise XOR operations to make any two array elements equal
- Count of pairs of strings which differ in exactly one position
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Count of pairs between two arrays such that the sums are distinct
- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Partiton the string in two parts such that both parts have at least k different characters
- Minimum number of given operations required to reduce the array to 0 element
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array
- Print characters having odd frequencies in order of occurrence
- Count number of pairs in array having sum divisible by K | SET 2
- Maximum length of a sub-array with ugly numbers
- Extendible Hashing (Dynamic approach to DBMS)
- Rearrange given string to maximize the occurrence of string t
- Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
- Check if product of array containing prime numbers is a perfect square
- Number of ways in which the substring in range [L, R] can be formed using characters out of the range
- What are Hash Functions and How to choose a good Hash Function?
- Count of quadruplets with given Sum | Set 2
- Count distinct points visited on the number line
- Find the difference of count of equal elements on the right and the left for each element

Given an array arr[] of N distinct integers. The task is to find the sum of two array integers a[i] + a[j] which occurs maximum… Read More »

Given an array arr[] of N integers. The task is to find the number of index quadruples (i, j, k, l) such that a[i], a[j]… Read More »

Given an array arr[] of N integer elements and an integer K. The task is to count all distinct arr[i] such that arr[i] appears at… Read More »

Given an array arr[] consisting of N positive integers, and some queries consisting of a range [L, R], the task is to find whether the… Read More »

Given an array arr[] of N integer elements, the task is to change the minimum number of elements of this array such that it contains… Read More »

Given an array arr[], the task is to count unordered pairs of positive integers (p, q) such that p occurs in the array at least… Read More »

Given an unsorted sequence a[], the task is to find the K-th missing contiguous element in the increasing sequence of the array elements i.e. consider… Read More »

Given a character array arr[] containing only lowercase English alphabets, the task is to print the maximum length of the subarray such that the first… Read More »

Given an array of N numbers, the task is to find the number of sub-arrays (size of the sub-array should be an even number) of… Read More »

Given an array arr[] and an integer k, the task is to find the maximum product from the array such that the frequency sum of… Read More »

Given an array arr[] of N elements, the task is to find the length of the longest sub-sequence in arr[] such that all the elements… Read More »

Given a Binary Tree with distinct values, the task is to print the first smallest root to leaf path. We basically need to print the… Read More »

Given n sentences. The task is to count the number of words that appear in all of these sentences. Note that every word consists of… Read More »

Given an array arr[], the task is to print the count of unique pairs (arr[i], arr[j]) such that i < j. Examples: Input: arr[] =… Read More »

Given an array arr[] of N elements and an integer K, the task is to find the number of ways of choosing an integer X… Read More »