I interviewed with the company before and came very close to being hired, so they expedited the process and had me interviewed in their NY office without going through phone interviews.

The questions they asked were easier than I thought. You just need to make sure you remember all those basic data structures and algorithms, and be careful not to make dumb mistakes.

There was only one hard problem, but if you know dynamic programming, you shouldn't have trouble solving it.

Given n numbers and one number s, find out whether there are two numbers from the n numbers that sum up to the number s. Finding one solution is extremely easy, but what is required is to find out ALL solutions to the problem and analyze the runtimes.