3 time complexity trivia questions. Anyone pursuing a CS or adjacent degree should know how to do these. Followed by 3 coding challenges that build on each other. We had to perform time complexity and space complexity on all 3 problems. I was able to complete the problems with 15 mins remaining on the clock.
To explain the time and space complexity of two different algorithms
1.Nodes with only one parent or zero parents. 2Possible moves with only one step (2d matrix)
1) Decomposition and Learning questions 2) CV and background questions 3) Why palantir
Trees and special sorts.
On-site Design Interview: How would you design a version control system?
Why do you want to work at Palantir?
Leetcode medium on hacker rank
"Catching an insider trader". Pretty easy problem. You can solve the problem with 2 hash-tables and with a banal sorting procedure.
Name a time when you were in a difficult situation. Name the superhero that you can identify most with.
Viewing 8521 - 8530 interview questions