## Count of even set bits between XOR of two arrays

Given two arrays A[] and B[] having N and M positive elements respectively. The task is to count the number of elements in array A… Read More »

- Find a pair (n,r) in an integer array such that value of nPr is maximum
- Minimum increment or decrement operations required to make the array sorted
- Count of elements which are not at the correct position
- Color all boxes in line such that every M consecutive boxes are unique
- Find missing elements from an Array
- Maximum length sub-array which satisfies the given conditions
- Find a pair (n,r) in an integer array such that value of nCr is maximum
- Choose X elements from A[] and Y elements from B[] which satisfy the given condition
- Minimum halls required for class scheduling
- Check whether N is a Factorion or not
- Index of the elements which are equal to the sum of all succeeding elements
- C++ Program to print an Array using Recursion
- Sum of values of all possible non-empty subsets of the given array
- Count equal element pairs in the given array
- Bitwise XOR of elements having odd frequency
- Sentinel Linear Search
- How to implement our own Vector Class in C++?
- Find the minimum value of X for an expression
- Queries to find the count of integers in a range that contain the given pattern
- Count of elements on the left which are divisible by current element
- Range maximum query using Sparse Table
- Minimum value to be assigned to the elements so that sum becomes greater than initial sum
- Count the pairs in an array such that the difference between them and their indices is equal
- Significant Inversions in an Array
- Number of K length subsequences with minimum sum
- Minimum steps required to reduce all the elements of the array to zero
- Number of ways to erase exactly one element in the Binary Array to make XOR zero
- Product of values of all possible non-empty subsets of given Array
- Find the ratio of number of elements in two Arrays from their individual and combined average
- Sort the numbers according to their product of digits

Given two arrays A[] and B[] having N and M positive elements respectively. The task is to count the number of elements in array A… Read More »

Given an array arr[] of N positive integers. The task is to print all possible pairs such that their XOR is a Prime Number. Examples:… Read More »

Given an array arr[] of even number of element N in it. The task is to form N/2 pairs such that sum of product of… Read More »

Given a perfect square natural number N. The task is to find all the factors of N. Examples Input: N = 100 Output: 1 2… Read More »

Given Q queries containing ranges in the form of [L, R], the task is to find the sum of all non-fibonacci numbers for each range… Read More »

Given two arrays A[] and B[] of length N, the task is to find the minimum number of operations in which the array A can… Read More »

Given two arrays arr1[] and arr2[] of equal size which contains distinct elements, the task is to find another array with distinct elements such that… Read More »

Given two arrays A[] and B[] of size N, the task is to count the maximum number of pairs, where each pair contains one from… Read More »

Given an array arr[], the task is to count the number of consecutive Fibonacci pairs in this array. Examples: Input: arr[] = { 3, 5,… Read More »

Given an integer array arr[] of size N and a positive integer K, the task is to count all the distinct pairs in the array… Read More »

Given a binary array arr[] of length N, the task is to find the minimum flips required in the array such that XOR of a… Read More »

Given an array arr[] containing N points and a reference point P, the task is to sort these points according to it’s distance from the… Read More »

Given an array arr[] and an integer K, the task is to calculate the sum of all subarrays of size K. Examples: Input: arr[] =… Read More »

Given an array arr[] of N integers, the task is to find the longest subarray where all numbers in that subarray are prime. Examples: Input:… Read More »

Given an array arr[][] consisting of Q queries where every row consists of two numbers L and R which denotes the range [L, R]; the… Read More »