## GCD of elements which occur prime number of times

Given an array arr[] of N elements, the task is to find the GCD of the elements which have prime frequencies in the array. Note… Read More »

- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Extendible Hashing (Dynamic approach to DBMS)
- Count number of pairs in array having sum divisible by K | SET 2
- What are Hash Functions and How to choose a good Hash Function?
- Minimum deletions required to make frequency of each letter unique
- Sum of nodes in the left view of the given binary tree
- Check duplicates in a stream of strings
- Find missing elements from an Array
- Print characters having even frequencies in order of occurrence
- Program to parse the Molecules and get the Atoms count
- XOR of elements in an array having prime frequency
- Sum of nodes in the right view of the given binary tree
- Triangle of numbers arising from Gilbreath's conjecture
- XOR of K smallest prime and composite numbers from the given array
- Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Print characters having prime frequencies in order of occurrence
- Count equal element pairs in the given array
- Number of distinct pair of edges such that it partitions both trees into same subsets of nodes
- Product of elements in an array having prime frequency
- GCD of elements which occur prime number of times
- Print the season name of the year based on the month number
- Area of the largest square that can be formed from the given length sticks using Hashing
- Check if two Integer are anagrams of each other
- XOR of K largest prime and composite numbers from the given array

Given an array arr[] of N elements, the task is to find the GCD of the elements which have prime frequencies in the array. Note… Read More »

Given an array arr[] of N non-zero positive integers and an integer K, the task is to find the XOR of the K largest prime… Read More »

Given an array arr[] of N positive integers, the task is to calculate the absolute difference between XOR of non-prime numbers and prime numbers. Note… Read More »

Given an array of positive numbers, the task is to find the bitwise AND of the sum of non-prime numbers and the sum of prime… Read More »

Given a binary tree, the task is to find the sum of the nodes which are visible in the left view. The left view of… Read More »

Given an array arr[] of N elements, the task is to find the xor of the elements which have prime frequencies in the array. Note… Read More »

Given a binary tree, the task is to find the sum of the nodes which are visible in the right view. The right view of… Read More »

Given a string S consisting of lowercase characters, you have to delete the minimum number of characters from S so that every letter in S… Read More »

Given a string str containing only lowercase characters. The task is to print the characters having prime frequency in the order of their occurrence. Note… Read More »

Given an array arr[] of N elements, the task is to find the product of the elements which have prime frequencies in the array. Since,… Read More »

Given a string str containing only lowercase characters. The task is to print the characters having an even frequency in the order of their occurrence.… Read More »

Given an array arr[] of N integers representing the heights of the sticks. The task is to find the area of the largest square that… Read More »

Given the month number M, the task is to print the season name of the year based on the month number. Examples: Input: M =… Read More »

Prerequisite: Hashing | Set 1 (Introduction) What is a Hash Function? A function that converts a given big phone number to a small practical integer… Read More »