## Count of distinct XORs formed by rearranging two Binary strings

Given two binary strings A and B of equal length N, the task is to find the number of distinct XORs possible by arbitrarily reordering… 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
- Find missing elements from an Array
- Find a pair (n,r) in an integer array such that value of nCr is maximum
- Minimum halls required for class scheduling
- C++ Program to print an Array using Recursion
- Sum of values of all possible non-empty subsets of the given array
- How to implement our own Vector Class in C++?
- Find the minimum value of X for an expression
- Count the pairs in an array such that the difference between them and their indices is equal
- Minimum value to be assigned to the elements so that sum becomes greater than initial sum
- Range maximum query using Sparse Table
- Count of elements on the left which are divisible by current element
- Queries to find the count of integers in a range that contain the given pattern
- 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
- Probability that a random pair chosen from an array (a[i], a[j]) has the maximum sum
- Find the deleted value from the array when average of original elements is given

Given two binary strings A and B of equal length N, the task is to find the number of distinct XORs possible by arbitrarily reordering… Read More »

Given an array arr, containing non-negative integers and (-1)s, of size N, the task is to replace those (-1)s with a common non-negative integer such… Read More »

Given a number K, the task is to print the fibonacci numbers present at Kth level of a Fibonacci Binary Tree. Examples: Input: K =… Read More »

Given an array arr[] of length N and an integer K, the task is to count pairs in the array whose product is Kth power… Read More »

Given an array arr of integers of size N and an integer K, the task is to find the XOR of all the numbers which… Read More »

Given an array of integers arr of size N, the task is to print products of all subarrays of the array. Examples: Input: arr[] =… Read More »

Given an array arr[] containing integers of size N, the task is to find the XOR of this array. Examples: Input: arr[] = {2, 4,… Read More »

Given an integer array arr[] of size N, the task is to find the longest subsequence S such that for every a[i], a[j] ∈ S… Read More »

Given a Vector of Vectors (2D vector), the task is to flatten this 2d vector. Examples: Input: vector = [[1, 2, 3, 4], [5, 6],… Read More »

Given an array of integers arr[], the task is to find the minimum number of steps to make array elements equal by following two operations… Read More »

Given a directed graph with V vertices and E edges without self-loops and multiple edges, the task is to find the minimum number of colors… Read More »

Given a sorted array arr of size N, the task is to reduce the array such that each element can appear at most K times.… Read More »

Given a binary array of size N and a range in [l, r], the task is to find the maximum distance between two 1s in… Read More »

Given an array arr containing non-negative integers, the task is to print the length of the longest subsequence of Fibonacci numbers in this array. Examples:… Read More »

Given a set of lines represented by a 2-dimensional array arr consisting of slope(m) and intercept(c) respectively and Q queries such that each query contains… Read More »