## Find if a binary matrix exists with given row and column sums

Given an array Row[] of size R where Row[i] is the sum of elements of the ith row and another array Column[] of size C… Read More »

- Highest power of 2 that divides a number represented in binary
- Check if the binary representation of a number has equal number of 0s and 1s in blocks
- Find row with maximum and minimum number of zeroes in given Matrix
- Minimizing array sum by applying XOR operation on all elements of the array
- Count all prefixes of the given binary array which are divisible by x
- Number of 0s and 1s at prime positions in the given array
- Check if matrix A can be converted to B by changing parity of corner elements of any submatrix
- Queries to answer the number of ones and zero to the left of given index
- Minimum length subarray of 1s in a Binary Array
- Count numbers have all 1s together in binary representation
- Find if a binary matrix exists with given row and column sums
- Smallest index such that there are no 0 or 1 to its right
- Maximum elements which can be crossed using given units of a and b

Given an array Row[] of size R where Row[i] is the sum of elements of the ith row and another array Column[] of size C… Read More »

Given an array arr[] of size N where each element is either 0 or 1. The task is to find the count of 0s and 1s which are at prime… Read More »

Given a 2D matrix containing only zeroes and ones, where each row is sorted. The task is to find the row with the maximum number… Read More »

Given binary array. The task is to find the length of subarray with minimum number of 1s. Note: It is guaranteed that there is atleast… Read More »

Given an array arr[] of N integer elements, the task is to choose an element X and apply XOR operation on every element of the… Read More »

Given a binary string str, the task is to find the largest power of 2 that divides the decimal equivalent of the given binary number.… Read More »

Given a binary array of N elements and two initial values a and b. We can cross the i-th element if: If a[i] == 0,… Read More »

Given two binary matrices A[][] and B[][] of N X M. In a single operation, one can choose a sub-matrix (min of 2 rows and… Read More »

Given a binary array and Q queries. Every query consists of a number K, the task is to print the number of ones and zeros… Read More »

Given a binary array arr[] and an integer x, the task is to count all the prefixes of the given array which are divisible by… Read More »

Given a binary array of N numbers. The task is to find the smallest index such that there are either no 1’s or 0’s to… Read More »

Given an integer N, the task is to check if its equivalent binary number has the equal frequency of consecutive blocks of 0 and 1.… Read More »

Given an integer n, the task is to count the total lucky numbers smaller than or equal to n. A number is said to be… Read More »

Given that N person (numbered 1 to N) standing as to form a circle. They all have the gun in their hand which is pointed… Read More »

Given a number N. The task is to find the sum of the decimal equivalent of all the pairs formed from the binary representation of… Read More »