Given an adjacency matrix adj[][] of an undirected graph consisting of N vertices, the task is to find whether the graph contains a Hamiltonian Path… Read More

subset

Bit Magic

Dynamic Programming

Graph

Matrix

Minimize sum of an array having Bitwise AND of all its pairs present in a given matrix

Given a square symmetric matrix mat[][] of size N, the task is to find the minimum sum possible of an array arr[] of size N,… Read More

Queries to calculate Bitwise AND of an array with updates

Given an array arr[] consisting of N positive integers and a 2D array Q[][] consisting of queries of the type {i, val}, the task for… Read More

Sum of decimals that are binary representations of first N natural numbers

Hard

Given a positive integer N, the task is to calculate the sum of all decimals which can be expressed as binary representations of first N… Read More

binary-representation

Maximize product of lengths of strings having no common characters

Hard

Given an array arr[] consisting of N strings, the task is to find the maximum product of length of the strings arr[i] and arr[j] for… Read More

Check if Bitwise AND of concatenation of diagonals exceeds that of middle row/column elements of a Binary Matrix

Given a binary matrix mat[][] of dimensions N * N, the task is to check if Bitwise AND of the decimal numbers obtained by concatenating… Read More

Distinct Numbers obtained by generating all permutations of a Binary String

Medium

Given a binary string S, the task is to print all distinct decimal numbers that can be obtained by generating all permutations of the binary… Read More

Absolute difference between the count of set bits in N and its reverse

Medium

Given an integer N, the task is to find the absolute difference between the number of set bits present in the number N and in… Read More

Count pairs with odd Bitwise XOR that can be removed and replaced by their Bitwise OR

Given an array arr[] consisting of N integers, the task is to count the number of pairs whose Bitwise XOR is odd, that can be… Read More

Queries to calculate maximum Bitwise XOR of X with any array element not exceeding M

Hard

Given an array arr[] consisting of N non-negative integers and a 2D array queries[][] consisting of queries of the type {X, M}, the task for… Read More

Bitwise-XOR

Trie

Advanced Data Structure

Arrays

Bit Magic

Tree

Count pairs whose Bitwise AND exceeds Bitwise XOR from a given array

Given an array arr[] of size N, the task is to count the number of pairs from the given array such that the Bitwise AND… Read More