Thursday, May 24, 2012

Given an array of integers and a value.Which array index will give maximum result after XORing with the given value. How can we find that efficiently?


Wednesday, May 23, 2012

You are getting a stream of characters and at any time you can be asked to find out if the string received yet is palindrome or not. There can be multiple queries.He insisted to do it in better than O(n) and No extra space.


Saturday, May 19, 2012

Power Tower Problem-

Given two power towers, find out which one is larger. Power tower is a number of the form : a1 ^ ( a2 ^ (a3 ^ (.... ^an)

You can assume that N <= 100, and each ai <= 100.
I don't have any efficient solution yet.

Source:
A sub-task in ICPC world finals 2012

Thursday, May 3, 2012

You are given a positive integer A. The goal is to construct the shortest possible sequence of integers ending with A, using the following rules

the first element of the sequence is 1,each of the successive elements is the sum of any two preceding elements (adding a single element to itself is also permissible),
each element is larger than all the preceding elements; that is, the sequence is increasing.
For example, for A = 42, a possible solutions is [1, 2, 3, 6, 12, 24, 30, 42]. Another possible solution is [1, 2, 4, 5, 8, 16, 21, 42].