Bit Magic - Basic Articles

Add minimum number to an array so that the sum becomes even

Given an array, write a program to add the minimum number(should be greater than 0) to the array so that the sum of array becomes… Read More

Arrays

Bit Magic

DSA

Mathematical

Print ‘K’th least significant bit of a number

A number N is given. We need to print its ‘K’th Least Significant Bit.Examples : Input : num = 10, k = 4 Output :… Read More

Bit Magic

DSA

Check if two numbers are equal without using comparison operators

The following are not allowed to use Comparison Operators String function Examples: Input : num1 = 1233, num2 =1233Output : Same Input : num1 =… Read More

Bit Magic

DSA

Find the largest number with n set and m unset bits

Given two non-negative numbers n and m. The problem is to find the largest number having n number of set bits and m number of… Read More

Bit Magic

DSA

Check in binary array the number represented by a subarray is odd or even

Given an array such that all its terms is either 0 or 1.You need to tell the number represented by a subarray a[l..r] is odd… Read More

array-range-queries

Arrays

Bit Magic

DSA

Find missing number in another array which is shuffled copy

Given an array ‘arr1’ of n positive integers. Contents of arr1[] are copied to another array ‘arr2’, but numbers are shuffled and one element is… Read More

Bitwise-XOR

Arrays

Bit Magic

DSA

Toggling k-th bit of a number

For a given number n, if k-th bit is 0, then toggle it to 1 and if it is 1 then, toggle it to 0.Examples… Read More

Bit Magic

DSA

Check whether K-th bit is set or not

Given a number N and a bit number K, check if the Kth bit of N is set or not. A bit is called set… Read More

Microsoft

Bit Magic

DSA

Strings

Construct an array from XOR of all elements of array except element at same index

Given an array A[] having n positive elements. The task to create another array B[] such as B[i] is XOR of all elements of array… Read More

Bitwise-XOR

Arrays

Bit Magic

DSA

Count minimum bits to flip such that XOR of A and B equal to C

Given a sequence of three binary sequences A, B and C of N bits. Count the minimum bits required to flip in A and B… Read More

Bitwise-XOR

Bit Magic

DSA

Compare two integers without using any Comparison operator

Given two integers A & B. Task is to check if A and B are same or not without using comparison operators.Examples: Input : A… Read More

Bitwise-XOR

Bit Magic

DSA

Check if a number has bits in alternate pattern | Set 1

Given an integer n > 0, the task is to find whether this integer has an alternate pattern in its bits representation. For example- 5… Read More

Bit Magic

DSA

Multiply a number with 10 without using multiplication operator

Given a number, the task is to multiply it with 10 without using multiplication operator?Examples: Input : n = 50 Output: 500 // multiplication of… Read More

Bit Magic

DSA

Check whether a given number is even or odd

Given a number, check whether it is even or odd. Examples : Input: 2 Output: even Input: 5 Output: odd Recommended Practice Odd Even Problem… Read More

Bit Magic

DSA

Mathematical

Sorting

Strings

1’s and 2’s complement of a Binary Number

Given a Binary Number as a string, print its 1’s and 2’s complements. 1’s complement of a binary number is another binary number obtained by… Read More

Amazon

binary-representation

complement

Arrays

Bit Magic

DSA

Strings

Check if two numbers are equal without using arithmetic and comparison operators

Given two numbers, the task is to check if two numbers are equal without using Arithmetic and Comparison Operators or String functions. Method 1 : The… Read More

Bit Magic

DSA

How to swap two numbers without using a temporary variable?

Given two variables, x, and y, swap two variables without using a third variable. Method 1 (Using Addition and subtraction) The idea is to… Read More

Bitwise-XOR

Swap-Program

Bit Magic

DSA

Mathematical

Find position of the only set bit

Given a number N having only one ‘1’ and all other ’0’s in its binary representation, find position of the only set bit. If there… Read More

Microsoft

Bit Magic

DSA

Detect if two integers have opposite signs

Given two signed integers, write a function that returns true if the signs of given integers are different, otherwise false. For example, the function should… Read More

Bitwise-XOR

Bit Magic

DSA

Count number of bits to be flipped to convert A to B

Given two numbers A and B. Write a program to count the number of bits needed to be flipped to convert A to B. Examples: … Read More

Amazon

Bitwise-XOR

Qualcomm

Samsung

Bit Magic

DSA