# Tag Archives: binary-representation

Give binary string str and an integer N, the task is to check if the substrings of the string contain all binary representations of non-negative… Read More
Given an integer N, the task is to find the number of binary strings possible of length N having same frequency of 0s and 1s.… Read More
Given a number N, the task is to check first whether the given number is binary or not and its value should be greater than… Read More
Given an array of N elements which denotes the array representation of binary heap, the task is to find the leaf nodes of this binary… Read More
Given a positive integer N, the task is to check whether the binary equivalent of that integer ends with the given string str or not. Print… Read More
Given a grid of size N*M consists of 0 and 1 only, the task is to find the length of longest connected 1s in the… Read More
Given an integer N, the task is to find the total number of bits toggled to obtain all numbers from 0 to N sequentially. Examples:… Read More
Prerequisite: Bitset function in STL library Given a number N, the task is to find the absolute difference of the number of set and unset bits… Read More
Given an integer N, the task is to flip all the bits to the left of rightmost set bit and print the number generated. Examples:… Read More
Given a binary valued undirected graph with V vertices and E edges, the task is to find the hexadecimal equivalents of all the connected components… Read More
Given a binary array arr, the task is to find the maximum number of 0s that can be flipped such that the array has no… Read More
Given a number N, the task is to write C program to count the number of 0s and 1s in the binary representation of N.… Read More
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
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