Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Misc7.7K+ articles

Mathematical5.1K+ articles

Arrays4.2K+ articles

Dynamic Programming1.1K+ articles

Bit Magic821+ articles

Bitwise-XOR443+ articles

Bitwise-AND149+ articles

setBitCount127+ articles

Bit Algorithms

57 posts

Assign Campus Bikes to Workers II

Last Updated: 23 July 2025

On a 2D grid representing a campus, there are n workers and m bikes, with 1 = n = m = 10. Each worker and bike is assigned a 2D coordinate on this grid. The tasks is to as...read more

Dynamic Programming

Smallest subarray such that its bitwise OR is at least k

Last Updated: 12 May 2024

Given an array arr[] of non-negative integers and an integer k. The task is to find the smallest non-empty subarray of arr[] such that the bitwise OR of all of its element...read more

Bitwise Algorithm in Python

Last Updated: 23 July 2025

Bitwise algorithms refer to the use of bitwise operators to manipulate individual bits of data. Python provides a set of bitwise operators such as AND (), OR (|), XOR (^),...read more

article_image

XOR Graph Minimum Spanning Tree

Last Updated: 23 July 2025

Given a complete weighted graph where edges have weights determined by the bitwise-xor operation. The graph has N vertices numbered from 0 to N-1, and each undirected edge...read more

Algorithms-Bit Algorithms

Geeks Premier League 2023

Minimizing Binary statements: Transforming a Binary String to all Zeroes

Last Updated: 07 November 2023

Given a set of N binary statements represented by a string S, where '1' represents a true statement and '0' represents a false one. You can perform the following operation...read more

Maximize Bitwise AND product function

Last Updated: 23 July 2025

Given two non-negative integers A and B find the smallest non-negative integer m such that the product of (A m) and(B m) is maximized.Examples:Input: A = 5, B = 10Output...read more

Introduction to Bitwise Algorithms

Last Updated: 09 May 2026

Bitwise operators are special operators in programming that work directly on binary bits (0 and 1). Since computers store all data in binary form, bitwise operations help ...read more

article_image

Find a number X such that XOR of given Array after adding X to each element is 0

Last Updated: 23 July 2025

Given an array arr[] of odd length N containing positive integers. The task is to find a positive integer X such that, adding X to all the elements of arr[] and then takin...read more

Count of subsets having maximum possible XOR value

Last Updated: 23 July 2025

Given an array arr[] consisting of N positive integers. The task is to count the number of different non-empty subsets of arr[] having maximum bitwise XOR.Examples:Input: ...read more

Minimum number of days to debug all programs

Last Updated: 23 July 2025

Given N program codes and their respective debugging times in an array codeTime and an integer WorkingSessionTime, the ith program takes codeTime[i] hours to finish. Worki...read more

Dynamic Programming

Construct lexicographically smallest Binary array of size N with A 0s and X inversion count

Last Updated: 23 July 2025

Given three numbers N, A, and X, the task is to construct the lexicographically smallest binary array of size N, containing A 0s and having an inversion count of X.Example...read more

two-pointer-algorithm

lexicographic-ordering

Count of numbers in range [L, R] with LSB as 0 in their Binary representation

Last Updated: 23 July 2025

Given two integers L and R. The task is to find the count of all numbers in the range [L, R] whose Least Significant Bit in binary representation is 0. Examples: Input: L ...read more

Count numbers in the range [l, r] having only three set bits

Last Updated: 28 May 2026

Given two integers l and r, find the count of numbers x such that:l ≤ x ≤ rThe binary representation of x contains exactly 3 set bits.Return the total count of such number...read more

All about Bit Manipulation

Last Updated: 23 July 2025

Bit Manipulation is a technique used in a variety of problems to get the solution in an optimized way. This technique is very effective from a Competitive Programming poin...read more

article_image

Technical Scripter

Technical Scripter 2020

Find array elements with rightmost set bit at the position of the rightmost set bit in K

Last Updated: 23 July 2025

Given an array arr[] consisting of N and an integer K, the task is to print the elements of arr[] whose rightmost set bit is at the same position as the rightmost set bit ...read more

Technical Scripter

Technical Scripter 2020

1 2 3 4