## Number of subarrays such that XOR of one half is equal to the other

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 »

- 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
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Count of pairs of strings which differ in exactly one position
- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Count of pairs between two arrays such that the sums are distinct
- 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
- Print characters having odd frequencies in order of occurrence
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array
- Count number of pairs in array having sum divisible by K | SET 2
- Extendible Hashing (Dynamic approach to DBMS)
- Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
- What are Hash Functions and How to choose a good Hash Function?
- Rearrange given string to maximize the occurrence of string t
- Check if product of array containing prime numbers is a perfect square
- Count of quadruplets with given Sum | Set 2
- Find the difference of count of equal elements on the right and the left for each element
- Count distinct points visited on the number line
- Find number of unique triangles among given N triangles
- Print characters having even frequencies in order of occurrence

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 »

Given an integer N, the task is to find out whether it can be written as a sum of 2 triangular numbers (which may or… Read More »

Given two strings str1 and str2 where str1 being the parent string. The task is to find out the number of string as str2 that… Read More »

Given an array of N elements, the task is to find all the unique pairs that can be formed using the elements of a given… Read More »

Given two integer arrays arr[] and cost[] where cost[i] is the cost of choosing arr[i]. The task is to choose a subset with at least… Read More »

Given a starting position ‘k’ and two jump sizes ‘d1’ and ‘d2’, our task is to find the minimum number of jumps needed to reach… Read More »

Given a Binary Tree, return following value for it. For every level, compute sum of all leaves if there are leaves at this level. Otherwise… Read More »

Given an unsorted array, count all distinct elements in it. Examples: Input : arr[] = {10, 20, 20, 10, 30, 10} Output : 3 There… Read More »

You are given an array of strings str[], the task is to find the score of a given string s from the array. The score… Read More »