Bit manipulation, Next Sparse Number Question http://www.lintcode.com/en/problem/next-sparse-number/ A number is Sparse if there are no two adjacent 1s in its binary representation. Given a number n, find the smallest Sparse number which

Trie, Maximum Subarray VI Question Given an array of integers. find the maximum XOR subarray value in given array. What's the XOR: https://en.wikipedia.org/wiki/Exclusive_or Notice Expected time complexity O(n). Answer https: