Call with engineer. Then onsite. By far, the hardest interview I ever had (and I interviewed at Facebook, Microsoft, and Amazon prior to that). Three questions, all of them DP/recursion. Good luck. I'm not sure if it's worth it, since the location is very undesirable. The office was nice, though.

Subset sum.

We have [(slc, lax), (slc, sea), (sea, lax), (lax, sea)…]. Find a path from src to dest in k hops. Return true if there is.

And one more I can't recall.