CareerCup

find longest increasing subsequence not necessarily contiguous in nlogn time. I knew how do it n2 time but was unable to do it in nlogn

Given a sum and number of digits n. Find all the combinations of single digit numbers that are equal to sum. For example if sum=13 and n=2, one of the ans should be 6,7 and so on

a) There is a square of nxn size which is comprised of n-square 1x1 squares. Some of these 1x1 squares are colored. Find the biggest subsquare which is not colored.
b) Also asked to extend it to find the biggest area rectangle.
12

Suppose we can compare two arrays like:
{4,2,3} > {3,5,6}
{4,2,3} < {4,3,0}
In each move, you can only switch a number with one of its neighbor. Given an array and a number n, design an algorithm to make this array maximum using n moves. (needs clarification)

You are given a set of boxes b1 to bn. Each box bj has an associated width wj ,
height hj and depth dj . Give an algorithm for creating the highest possible stack of boxes with the
constraint that if box bj is stacked on box bi, the 2D base of bi must be larger in both dimensions
than the base of bj . You can of course, rotate the boxes to decide which face is the base, but you
can use each box only once.
For example, given two boxes with h1 = 5;w1 = 5; d1 = 1 and h2 = 4;w2 = 5; h2 = 2, you should
orient box 1 so that it has a base of 5x5 and a height of 1 and stack box 2 on top of it oriented so
that it has a height of 5 for a total stack height of 6.

Give two binary search trees, print the numbers of both together in ascending order.

i have phone screens of linkedin, vmware and msft lined up. Any suggestions whats the level of questions for phone screen ? also vmware hacker rank questions ?