I was contacted by a recruiter through LinkedIn (very meta) and given two weeks for preparation.

The interviewer I was scheduled with wasn't the one who ended up interviewing me. Instead, it was someone who had a very tough time speaking English and explaining the problems.

I solved both questions, but it took a long time before I understood what he meant when trying to explain them. This chewed up a substantial chunk of the interview time. For example, it took approximately 5-10 minutes to even get to the collaborative online editor because I couldn't understand the letters he was pronouncing in the URL.

Write a function that, given a list of integers (both positive and negative), returns the sum of the contiguous subsequence with the maximum sum. Thus, given the sequence (1, 2, -4, 1, 3, -2, 3, -1), it should return 5.

Write a program that takes an integer and prints out all ways to multiply smaller integers that equal the original number, without repeating sets of factors. In other words, if your output contains 4 * 3, you should not print out 3 * 4 again, as that would be a repeating set. Note that this is not asking for prime factorization only. Also, you can assume that the input integers are reasonable in size; correctness is more important than efficiency.

PrintFactors(12)

12 * 1 6 * 2 4 * 3 3 * 2 * 2