## Generate an Array such with elements maximized through swapping bits

Given an array arr[], the task is to generate a modified array such that all its elements are maximized by swapping of bits.Examples: Input: arr[]… Read More »

- Find XOR of all elements in an Array
- Count of subarrays of an Array having all unique digits
- Check if a Number is Odd or Even using Bitwise Operators
- Bitwise AND of all the elements of array
- Count number of binary strings without consecutive 1’s : Set 2
- Program to find the Nth natural number with exactly two bits set
- XOR of every element of an Array with a given number K
- Partition of a set into K subsets with equal sum using BitMask and DP
- XOR of elements in a given range with updates using Fenwick Tree
- Bitwise XOR of a Binary array
- Count maximum occurrence of subsequence in string such that indices in subsequence is in A.P.
- Find a Mother vertex in a Graph using Bit Masking
- Count of pairs whose bitwise AND is a power of 2
- Check if left and right shift of any string results into given string
- Count subarrays with sum equal to its XOR value
- Maximum number of set bits count in a K-size substring of a Binary String
- Number of subsets with same AND, OR and XOR values in an Array
- Largest number in the Array having frequency same as value
- Find the largest number smaller than integer N with maximum number of set bits
- Count of binary strings of length N having equal count of 0's and 1's
- Find a number such that maximum in array is minimum possible after XOR
- XOR of pairwise sum of every unordered pairs in an array
- Count of subarrays of size K with elements having even frequencies
- Bitwise operations on Subarrays of size K
- Remove all even parity nodes from a Doubly and Circular Singly Linked List
- Maximum weighted edge in path between two nodes in an N-ary tree using binary lifting
- Sum of bit differences for numbers from 0 to N
- Find the remainder when N is divided by 4 using Bitwise AND operator
- Turn off the rightmost set bit | Set 2
- Find the length of the Largest subset such that all elements are Pairwise Coprime

Given an array arr[], the task is to generate a modified array such that all its elements are maximized by swapping of bits.Examples: Input: arr[]… Read More »

Given an array of N elements which denotes the array representation of binary heap, the task is to find the leaf nodes of this binary… Read More »

Given an array of N elements, the task is to find the minimum value of K such that Bitwise XOR of K with all array… Read More »

Given an array arr[] of length N, the task is to print the number of array elements which cannot form a pair with any other… Read More »

Given an array arr[] of N positive elements, the task is to find the maximum bitwise OR value of a pair from the given array.… Read More »

Given an integer N, the task is to print the number of binary strings of length N which at least one ‘1’. Examples: Input: 2… Read More »

Given a positive integer N, the task is to check whether the binary equivalent of that integer ends with a given string str or not. Print… Read More »

Given an array arr[] of N positive integers. The task is to find the number of pairs whose Bitwise AND value is a power of… Read More »

Given two integers N and M, the task is to print all elements in the range [N, M] having at least one odd divisor. Examples:… Read More »

Binary Coded Decimal, or BCD, is another process for converting decimal numbers into their binary equivalents. It is a form of binary encoding where each… Read More »

Given a string str that represents a number. The task is to find all possible ways to split the given string such that each segment… Read More »

Given two integers N and K, the task is to find the number of binary strings of length N having an even number of 1’s… Read More »

Given a binary string str of size N and a positive integer K, the task is to find the minimum number of flips required to… Read More »

Given N lists of strings, the task is to find the count of lists which are not a sublist of any other given lists. Examples:… Read More »

Given an integer N, the task is to find the total number of bits toggled to obtain all numbers from 0 to N sequentially. Examples:… Read More »