Given an input of a 3D matrix of ones and zeros, count the number of contiguous 1-filled regions (as separated by 0-filled regions), as well as the size of the largest one (I think; doesn't really change the problem much). I forget what these were called...
What are your career goals (and how does C3 come into play)?
Signed NDA (also don't remember the questions that well anymore.) There were some Palantir-y algorithms questions, a coding challenge (which was not hard), and one product question (think Google APM interview question but more technical - this is probably only forward developed people.)
Questions were mostly very similar to those found in Cracking the Coding Interview. If you haven't read this from end-to-end, stop reading these reviews, and go through it. Right now. Really. Some interviewers also tested my experience with Linux/sysadmin-like tasks. There were also some system design questions, asking how I could iteratively create some dashboard, and what feedback I would want from the client on my initial design.
How to check a grid of 1s were all connected (common question)
Tell us about your background
Viewing 1 - 10 interview questions