There is an offline coding problem that is combinatorics based. Pretty much needed to Google the problem as it was some esoteric college combinatorics theory. At the onsite interview they have a resume review, and two long live coding sessions. They ask you to talk about the algorithm to solve it and then code it on your own computer or theirs. They waste a lot of time talking about the problem and left me with little time to finish coding it.

Write and test the code for a game where you have a 3x3 grid and random arrangement of 3 colored pieces. Popping a piece pops all adjacent pieces of the same color and then causes the pieces above to fall down. There is a scoring system based on how many were popped each turn. Then find the maximum score for each a generic game board.

The next problem based on a list consisting of 1,5,10 and a 12 digit clock face. for each number in the list, you mark that spot on the clock and move that many spots then you use the next number. Find if the input string is a valid path around the clock (so as you travel you don't reach a spot that is already marked) Then create a generator that finds all valid paths around the clock.