Prashant Mishra

Problem We have to find the number that is present only once. Brute force approach will be to use...

Prashant Mishra

Problem TC : (n+m) where n and m are no. of bits in num1 and num2 respectively /* use...

Prashant Mishra

Problem We will use the concept of buckets, we want to make sure that two numbers that appear only...

Prashant Mishra

Problem Backtracking approach: TC:(2^n) i.e. exponential time complexity (Since we are left with...

Prashant Mishra

Swap two numbers without using the temp variable a = a^b b = a^b = (a^b)^b = a ( since...

Prashant Mishra

Given an integer number N, find the exor of the range 1 to N exor of 1 ^ 2 ^ 3 ^4 ^.....N; Brute...