In the bit representation of a number, find if there is exactly one bit that is set.
e.g. your approach should say true for the following numbers :
and false for the following numbers :
"Gebo" means to "give and take". This is my attempt to share the knowledge & experience with the community. Focus on Puzzles, Algorithms, Problem Solving, Java & other Technical Discussions.