Category Archives: Bit Magic

XOR Linked List – Reverse a Linked List in groups of given size
Given a XOR linked list and an integer K, the task is to reverse every K nodes in the given XOR linked list. Examples: Input:… Read More
Bitwise-XOR
Linked Lists
Reverse
Bit Magic
Data Structures
Linked List
Recursion
Minimize operations of removing 2i -1 array elements to empty given array
Given an array arr[] of size N, the task is to empty given array by removing 2i – 1 array elements in each operation (i… Read More
array-rearrange
Greedy Algorithms
setBitCount
Arrays
Bit Magic
Greedy
Find a K-length subarray having Bitwise XOR equal to that of remaining array elements
Given an array arr[] of size N, the task is to check if any subarray of size K exists in the array or not, whose… Read More
Bitwise-XOR
sliding-window
subarray
Arrays
Bit Magic
Mathematical
Searching
Generate a Matrix such that given Matrix elements are equal to Bitwise OR of all corresponding row and column elements of generated Matrix
Given a matrix B[][] of dimensions N * M, the task is to generate a matrix A[][] of same dimensions that can be formed such… Read More
array-rearrange
Bitwise-OR
Bit Magic
Mathematical
Matrix
Sum of Bitwise OR of every array element paired with all other array elements
Medium
Given an array arr[] consisting of non-negative integers, the task for each array element arr[i] is to print the sum of Bitwise OR of all… Read More
Bit Algorithms
Bitwise-OR
Technical Scripter 2020
Arrays
Bit Magic
Technical Scripter
XOR Linked List – Reversal of a List
Given a XOR linked list, the task is to reverse the XOR linked list. Examples: Input: 4 <–> 7 <–> 9 <–> 7Output: 7 <–>… Read More
Bitwise-XOR
doubly linked list
Linked Lists
Reverse
Bit Magic
Linked List
Check if an array can be split into K non-overlapping subarrays whose Bitwise AND values are equal
Given an array arr[] of size N and a positive integer K, the task is to check if the array can be split into K… Read More
Bitwise-AND
partition
subarray
Arrays
Bit Magic
Mathematical
Minimum row or column swaps required to make every pair of adjacent cell of a Binary Matrix distinct
Given a binary matrix M[][] of dimensions N x N, the task is to make every pair of adjacent cells in the same row or… Read More
array-rearrange
Bitwise-XOR
Bit Magic
Mathematical
Matrix
Sum of Bitwise AND of each array element with the elements of another array
Given two arrays arr1[] of size M and arr2[] of size N, the task is to find the sum of bitwise AND of each element… Read More
Bitwise-AND
frequency-counting
prefix
setBitCount
Arrays
Bit Magic
Hash
Generate an array of minimum sum whose XOR of same-indexed elements with given array are Prime Numbers
Given an array Arr[] of N ( 1 ≤ N ≤ 105)integers, the task is to generate an array B[] consisting of N non-zero elements,… Read More
Bitwise-XOR
Prime Number
Arrays
Bit Magic
Greedy
Mathematical
Find the number obtained by concatenating binary representations of all numbers up to N
Given an integer N, the task is to find the decimal value of the binary string formed by concatenating the binary representations of all numbers… Read More
binary-representation
Bitwise-AND
Bitwise-OR
interview-preparation
Numbers
Bit Magic
Interview Experiences
Minimum number of coins having value equal to powers of 2 required to obtain N
Given an integer N, the task is to find the minimum number of coins of the form 2i required to make a change for N… Read More
binary-representation
maths-power
setBitCount
Bit Magic
Mathematical
Flip bits of the sum of count of set bits of two given numbers
Given two numbers A and B, the task is to count the number of set bits in A and B and flip the bits of… Read More
binary-representation
setBitCount
Bit Magic
Mathematical
Generate a sequence from first X natural numbers which adds up to S on raising 2 to the power of their lowest set bits
Given two integers X and S, the task is to construct a sequence of distinct integers from the range [1, X] such that the sum… Read More
Bit Algorithms
Natural Numbers
Technical Scripter 2020
Bit Magic
Greedy
Mathematical
Technical Scripter
Median of Bitwise XOR of all submatrices starting from the top left corner
Medium
Given a 2D matrix mat[][] of size N * M, the task is to find the median of Bitwise XOR of all possible submatrices from… Read More
array-range-queries
Bitwise-XOR
Bit Magic
Dynamic Programming
Mathematical
Matrix
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox