## Array elements with prime frequencies

Given a string. The task is to find the count of characters whose number of occurrences is prime. Examples: Input : str = “geeksforgeeks” Output… Read More »

- LRU Cache Implementation
- Construct Tree from given Inorder and Preorder traversals
- unordered_map in C++ STL
- Find subarray with given sum | Set 2 (Handles Negative Numbers)
- Construct a Binary Tree from Postorder and Inorder
- map vs unordered_map in C++
- Number of subarrays having sum exactly equal to k
- Sort elements by frequency | Set 4 (Efficient approach using hash)
- Non-overlapping sum of two sets
- Find top k (or most frequent) numbers in a stream
- Count number of triplets with product equal to given number with duplicates allowed | Set-2
- Count All Palindrome Sub-Strings in a String | Set 2
- Sum of all odd frequency elements in an array
- Minimum operation to make all elements equal in array
- Postorder traversal of Binary Tree without recursion and without stack
- Longest Span with same Sum in two Binary arrays
- Non-Repeating Element
- Check if a key is present in a C++ map or unordered_map
- Traversing a map (or unordered_map) in C++ STL
- Elements that occurred only once in the array
- Find the first repeated word in a string
- Longest Increasing consecutive subsequence
- Concatenated string with uncommon characters of two strings
- Find All Duplicate Subtrees
- Minimum number of distinct elements after removing m items
- Printing longest Increasing consecutive subsequence
- Find top three repeated in array
- Find if there is a rectangle in binary matrix with corners as 1
- Count words that appear exactly two times in an array of words
- Find Sum of all unique sub-array sum for a given array.

Given a string. The task is to find the count of characters whose number of occurrences is prime. Examples: Input : str = “geeksforgeeks” Output… Read More »

Given an array of integers, replace every element by its frequency in the array. Examples: Input : arr[] = { 1, 2, 5, 2, 2,… Read More »

Given an array of integers, find the k smallest numbers after deleting given elements. In case of repeating elements delete only one instance in the… Read More »

Given an array of integers, find the k largest number after deleting the given elements. In case of repeating elements, delete one instance for every… Read More »

Given an array of integers, remove all the elements which appear strictly less than k times. Examples: Input : arr[] = {1, 2, 2, 3,… Read More »

Given an unsorted array of integers, Print the array after removing the duplicate elements from it. We need to print distinct array elements according to… Read More »

Given an array of integers, remove all the occurrences of those elements which appear strictly more than k times in the array. Examples: Input :… Read More »

Given an array of integers, find the smallest number after deleting given elements. In case of repeating elements, we delete one instance (from the original… Read More »

Given an unsorted array of integers. The task is to find any two non-overlapping pairs whose sum is equal. Two pairs are said to be… Read More »

Given an array of integers and an integer ‘k’, the task is to find the largest element from the array that is repeated exactly ‘k’… Read More »

Given a NxM matrix of integers containing duplicate elements. The task is to find the count of all majority occurring elements in the given matrix,… Read More »

Given a NxM matrix of integers containing duplicate elements. The task is to find the sum of all maximum occurring elements in the given matrix.… Read More »

Given a NxM matrix of integers containing duplicate elements. The task is to find the sum of all evem occurring elements in the given matrix.… Read More »

Given a NxM matrix of integers containing duplicate elements. The task is to find the sum of all minimum occurring elements in the given matrix.… Read More »

Given an array of integers containing duplicate elements. The task is to find the sum of all odd occurring elements in the given array. That… Read More »