Q1)An array A[1 n] contains all the integers from 0 to n except for one number which is missing . In this problem, we cannot access an entire integer in A with a single operation . The elements of A are represented in binary, and the only operation we can use to access them is “fetch the jth bit of A[i]”, which takes constant time Write code to find the missing integer . Can you do it in O(n) time?
Q2)Given an integer, print the next smallest and next largest number that have the same number of 1 bits in their binary representation . -- 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.
