Following coding questions were asked by Pocket Gems, a social gaming company based in San Francisco. Total duration was 1 hour.
1) Given an array of positive numbers. We can make any element of the array negative. We have to find the minimum positive sum after modifying numbers of array, by making some numbers negative.
2) Given an array of pairs of the form <a, b>. We have to find a sub-array such that the 1st element in the pairs are in increasing order and the sum of 2nd element of the pairs in the sub-array is maximum possible.
Source: Arun Chaudhary, DCE