Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Palantir Technologies nel mese di nov 2010
Colloquio
A bit disorganized. First the recruiter called me to ask dumb questions to see whether I could program or not (what is a stack? a queue? a hashtable). She was about an hour and a half late in calling, which was annoying. Then I had two phone interviews.
The first interviewer asked a lot of the same question: How can you efficiently find 3 numbers in an array that sum to 0? 4 numbers? 5 numbers? 6 numbers? My brain was bogged down by so many of the same question... haha. Then he asked how I would find a subarray that summed to zero (elements must be contiguous). After that he asked me to describe a "polynomial" time solution to subset sum (which is just dynamic programming). Interviewer was really interested and helpful.
Second phone interviewer didn't even know it was my second interview. Asked me how I would design an efficient sort for an array, given that every element was at most k positions away from its final sorted position. I didn't know what he was asking at first so I fumbled a lot. I got a good answer in the end but I guess I was too slow.
Domande di colloquio [4]
Domanda 1
Given an array of n integers find 3 that sum to zero.
...4 that sum to zero.
...5 that sum to zero.
...6 that sum to zero.
Given an array of n unsorted ints, with the condition that each number is at most k positions away from its final sorted position, give an efficient sorting algorithm.
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Palantir Technologies nel mese di mar 2022
Colloquio
The initial application is lengthy with some questions to answer. I was then interviewed by karat. This was 1 hour long with 3 orally answered algorithm questions followed by a coding question. I finished the first in 30 minutes and then we spoke about an approach for the second, much harder question.
Domande di colloquio [1]
Domanda 1
Time and space complexities for algorithms - DFS, BFS etc
Ho presentato la mia candidatura tramite un'altra fonte. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Palantir Technologies nel mese di nov 2018
Colloquio
First there was a screening interview with an HR over the phone. She asked about the projects I've done before, about my CV. Then they have sent me a coding challenge on HackerRank. I had 90 minutes to find a solution and code it.
Domande di colloquio [1]
Domanda 1
What was the most exciting part in this and that project? What did you learn through this experience? What exactly was your contribution to the project?
La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Palantir Technologies nel mese di gen 2012
Colloquio
I dropped my resume off at the career fair and was contacted by a recruiter. She set up a phone interview and had a 45 min technical phone interview with one of the engineers. The questions were pretty straight forward, but they focused more on algorithm design and thinking of efficient solutions, no coding for this interview. I wasn't too thrilled with the interviewer, because he seemed to be in a rush just to get the interview done and over with. Even when I initially asked questions about his job, what he was working on, etc, he spoke quickly and wanted to move onto the technical part asap. My impression is that these are smart people, but maybe too boxed into work for me.
Domande di colloquio [1]
Domanda 1
Given a Fibonacci number, tell us which index it occurs at. (Ex: input = 2, output = 3)
