Bit Magic - Basic Articles

Queries to replace every array element by its XOR with a given value with updates

Given an array, initially consisting of 0 as the only element present and Q operations of the following two types: Add(X): Insert X into the… Read More

array-rearrange

Bitwise-XOR

Google

interview-preparation

Algorithms

Arrays

Bit Magic

DSA

Mathematical

Unset least significant K bits of a given number

Given an integer N, the task is to print the number obtained by unsetting the least significant K bits from N. Examples: Input: N =… Read More

Bit Algorithms

Bitwise-AND

Bit Magic

DSA

Greedy

Mathematical

BCD or Binary Coded Decimal

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

base-conversion

Numbers

Bit Magic

DSA

Mathematical

XOR of elements in a given range with updates using Fenwick Tree

Given an array A[] of integers and array Q consisting of queries of the following two types: (1, L, R) : Return XOR of all… Read More

array-range-queries

Binary Indexed Tree

Bitwise-XOR

Advanced Data Structure

Analysis of Algorithms

Arrays

Bit Magic

Competitive Programming

Data Structures

DSA

Tree

Find the length of the Largest subset such that all elements are Pairwise Coprime

Given an array A of size N, our task is to find the length of the largest subset such that all elements in the subset… Read More

subset

Algorithms

Bit Magic

Competitive Programming

DSA

Dynamic Programming

Mathematical

Recursion

Find sum of xor of all unordered triplets of the array

Given an array A, consisting of N non-negative integers, find the sum of xor of all unordered triplets of the array. For unordered triplets, the… Read More

Bitwise-XOR

Algorithms

Bit Magic

Combinatorial

Competitive Programming

DSA

Mathematical

XOR of every element of an Array with a given number K

Given an array arr and a number K, find the new array formed by performing XOR of the corresponding element from the given array with… Read More

Bitwise-XOR

Arrays

Bit Magic

DSA

School Programming

Find the remainder when N is divided by 4 using Bitwise AND operator

Given a number N, the task is to find the remainder when N is divided by 4 using Bitwise AND operator. Examples: Input: N =… Read More

Bitwise-AND

Algorithms

Bit Magic

C Language

C Programs

C++

C++ Programs

Competitive Programming

CS - Placements

DSA

Java

Mathematical

Placements

Python

School Programming

String obtained by reversing and complementing a Binary string K times

Given a binary string of size N and an integer K, the task is to perform K operations upon the string and print the final… Read More

binary-string

complement

Reverse

Bit Magic

DSA

Strings

Find XOR of all elements in an Array

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

Bitwise-XOR

number-digits

Arrays

Bit Magic

DSA

Check if a Number is Odd or Even using Bitwise Operators

Given a number N, the task is to check whether the number is even or odd using Bitwise Operators. Examples: Input: N = 11 Output: Odd… Read More

Bitwise-AND

Bitwise-XOR

Bit Magic

DSA

School Programming

Maximize the number by flipping at most K bits

Given an integer N, the task is to find the greatest number that can be obtained by flipping at most K bits in the binary… Read More

Bit Magic

DSA

Greedy

Find the value of N XOR’ed to itself K times

Given two integer N and K, the task is to find the value of N XOR N XOR N XOR N … XOR N (K… Read More

Bit Magic

DSA

Mathematical

Find closest integer with the same weight

Given a positive integer X the task is to find an integer Y such that: The count of set bits is Y is equal to… Read More

Bit Magic

Competitive Programming

DSA

Mathematical

Technical Scripter

Maximize the Expression | Bit Manipulation

Given two positive integers A and B. Let’s define D such that B AND D = D. The task is to maximize the expression A… Read More

Bitwise-XOR

Algorithms

Bit Magic

Competitive Programming

DSA

Count number of bits to be flipped to convert A to B | Set-2

Given two integers A and B, the task is to count the number of bits needed to be flipped to convert A to B.Examples: Input:… Read More

Numbers

Bit Magic

C Language

C++

DSA

Find XOR of numbers from the range [L, R]

Given two integers L and R, the task is to find the XOR of elements of the range [L, R]. Examples: Input: L = 4, R… Read More

Bitwise-XOR

Arrays

Bit Magic

DSA

Mathematical

Find N distinct numbers whose bitwise Or is equal to K

Given two integers N and K, the task is to find N distinct integers whose bit-wise OR is equal to K. If there does not… Read More

Bitwise-OR

Bit Magic

DSA

Mathematical

Multiply a number by 15 without using * and / operators

Given a integer N, the task is to multiply the number with 15 without using multiplication * and division / operators. Examples: Input: N =… Read More

Numbers

Algorithms

Bit Magic

DSA

Minimum value among AND of elements of every subset of an array

Given an array of integers, the task is to find the AND of all elements of each subset of the array and print the minimum… Read More

Bit Magic

DSA