## Maximum number of chocolates to be distributed equally among k students

Given n boxes containing some chocolates arranged in a row. There are k number of students. The problem is to distribute maximum number of chocolates… 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 n boxes containing some chocolates arranged in a row. There are k number of students. The problem is to distribute maximum number of chocolates… Read More »

Prerequisite – Inorder/preorder/postorder traversal of tree Given a binary tree, perform postorder traversal. Recommended: Please try your approach on {IDE} first, before moving on to… Read More »

Given a string of length n. Find the minimum number of possible cuts after rearranging the string (if required), such that each cut is a… Read More »

Given a linked list, find its first non-repeating integer element. Examples: Input : 10->20->30->10->20->40->30->NULL Output :First Non-repeating element is 40. Input :1->1->2->2->3->4->3->4->5->NULL Output :First Non-repeating… Read More »

You are given an array of n-element. You have to make subsets from the array such that no subset contain duplicate elements. Find out minimum… Read More »

Given an array arr[] of size n containing 0 and 1 only. The problem is to count the subarrays having equal number of 0’s and… Read More »

Given an array A of n elements. We need to change the array into a permutation of numbers from 1 to n using minimum replacements… Read More »

Given an arr[] containing n integers and a positive integer k. The problem is to find the length of the longest subarray with sum of… Read More »

Given an array, A.Let x be an element in the array.x has the maximum frequency in the array.Find the smallest subsegment of the array which… Read More »

Prerequisite – Hashing Data Structure In database management system, When we want to retrieve a particular data, It becomes very inefficient to search all the… Read More »

Given an array arr[] containing n elements. The problem is to find maximum number of distinct elements (non-repeating) after removing k elements from the array.… Read More »

We are given an array of m-elements, we need to find n smallest elements from the array but they must be in the same order… Read More »

There are two players A and B who are interested in playing a game of numbers. In each move a player pick two distinct number,… Read More »

Given a string s (containing lowercase letters only), we have to find the minimum cost to construct the given string. The cost can determined using… Read More »

Given an array arr[] containing n integers. The problem is to find the length of the longest strict bitonic subsequence. A subsequence is called strict… Read More »