## Sum of the series 2^0 + 2^1 + 2^2 +…..+ 2^n

Given an integer N, the task is to find the sum of series 20 + 21 + 22 + 23 + …. + 2n. Examples:… Read More »

Given an integer N, the task is to find the sum of series 20 + 21 + 22 + 23 + …. + 2n. Examples:… Read More »

Given an array of N integers and an integer M. You can change the sign(positive or negative) of any element in the array. The task… Read More »

Given two binary strings. The task is to check if string s1 can be converted to string s2 by performing the given operations any number… Read More »

Given a number N, the task is to check whether the count of the set and unset bits in the given number are same. Examples:… Read More »

Given a row number n, and the task is to calculate the sum of all elements of each row up to nth row. Examples: Input… Read More »

Given two bracket sequences S1 and S2 consisting of ‘(‘ and ‘)’. The task is to check if the string obtained by concatenating both the… Read More »

Given a decimal number m, convert it into a binary string and apply n iterations, in each iteration 0 becomes “01” and 1 becomes “10”.… Read More »

Given Q queries, with each query consisting of two integers L and R, the task is to find the total numbers between L and R… Read More »

What is Calkin Wilf Sequence? A Calkin-Wilf tree (or sequence) is a special binary tree which is obtained by starting with the fraction 1/1 and… Read More »

Given two integers L and R. Determine the bitwise OR of all the integers in the range [L, R] (both inclusive). Examples: Input: L =… Read More »

Given a positive integer n, check whether only the first and last bits are set in the binary representation of n. Print ‘Yes’ or ‘No’.… Read More »

Given an array of N positive (32-bit)integers, the task is to answer Q queries of the following form: Query(L, R, K): Print the number of… Read More »

Given L and R. The task is to find the number in whose binary representation all bits between the L-th and R-th index are set… Read More »

Given an array of N integers. The bitwise OR of all the elements of the array has to be maximized by performing one task. The… Read More »

Given an array A of size n. the task is to generate a new sequence B with size N^2 having elements sum of every pair… Read More »