Can anyone suggest solution for this problem?

   You are given an unsigned integer.Write a function to print the next
   number which will be having same number of 1 bits present in given num.
   eg) 6(110) to 9(1001)

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to