Given a positive integer N, the task is to check whether the binary equivalent of that integer ends with “001” or not. Print “Yes” if it… Read More

# Tag Archives: binary-representation

Given an N*N binary matrix arr[][], the task is to check if the matrix contains a square of at least size 2 x 2 whose… Read More

Given a binary-valued Undirected Graph with V vertices and E edges, the task is to find the maximum decimal equivalent among all the connected components… Read More

Given a binary string S of length N, the task is to find the minimum number of bit flips required to convert the given string… Read More

Given a binary valued undirected graph with V vertices and E edges, the task is to find the octal equivalents of all the connected components… Read More

Given a binary matrix mat[][] consisting of 1s and 0s of dimension M * N, the task is to find the number of operations to… Read More

Given an integer N, the task is to count every number i from 1 to N (both inclusive) such that i is a binary representation… Read More

Given a binary number N, and a range represented by L, and R, the task is to convert the given binary number in all the… Read More

Given a binary array and an integer K, check if every pair of 1 in the array is at least K length apart from each… Read More

Given a Matrix of size N*N filled with 1‘s and 0‘s, the task is to find the maximum distance from a 0-cell to its nearest… Read More

Given any Real Number greater than or equal to zero that is passed in as float, print binary representation of entered real number. Examples: Input:… Read More

Given a binary array of size N and a range in [l, r], the task is to find the maximum distance between two 1s in… Read More

Given a binary array arr[], the task is to find the number of operations required to remove all 1s from the adjacent left of 0s.… Read More

Given a positive integer N, the task is to count all possible distinct binary strings of length N such that there are no consecutive 1’s.… Read More

Given a gold bar of length N with N equal markings, the task is to find the minimum number of cuts required to pay the… Read More