1 Phone Interview: with 1 problem with added restrictions and functionalities after each response.
1Onsite Interview: 1 remote coding challenge submitted beforehand, 3 interviewers, and short interviews with the cofounders
Interview questions [1]
Question 1
If you had a max heap with n elements and want to get the K largest elements
w/o popping and rebalancing, how would you do it?
I applied through a recruiter. The process took 2 weeks. I interviewed at Palantir Technologies (Palo Alto, CA)
Interview
One phone interview, followed by an onsite interview
Interview questions [1]
Question 1
One of the algorithm questions I received was genuinely difficult (probably the hardest question I've been asked in any software engineering interview, in fact), but I don't remember the details quite well enough to replicate it here. Aside from that, the questions I was asked were all reasonable; however, I was a bit surprised when one of the interviewers spent several minutes speaking generally about my personal tastes/opinions regarding object oriented design, asking questions like, "what is your favorite design pattern?" Frankly, I really don't have a "favorite design pattern", and I felt a bit awkward answering these questions (which were posed with much enthusiasm).
I had a phone interview with Palantir. The first stage was with an HR person who just asked a simple question about how to explain a stack to a middle schooler. Then during the second phone interview I was asked questions about hashing, using regex, and a question about binary trees. It wasn't really all that difficult. After that they asked why I wanted to work at Palantir and what I was interested in working on.
Interview questions [1]
Question 1
The most difficult question for me was what I was interested in working on