Forward deployed engineer Interview Questions | Glassdoor.co.uk

# Forward deployed engineer Interview Questions

50

forward deployed engineer interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

### Forward Deployed Software Engineer at Palantir Technologies was asked...

22 Nov 2017
 Merging of Sets: Sets Users which reference other user groups.6 AnswersRecursivelyHello! When did you interview?Beginning of NovemberShow more responsesOkay. Thanks!Hi, can you provide more details about the question? Thanks!Recursively is bad due performance ;-) Iterative is the better way.

### Forward Deployed Engineer at Palantir Technologies was asked...

8 Apr 2013
 (Systems design): Describe how you would build a generic job scheduler for our company?2 AnswersSystem diagrams on whiteboard encouraged.Did you talk about persistent messaging middleware?

### Forward Deployed Engineer at Palantir Technologies was asked...

10 Feb 2016
 All taxi drivers in a town need to meet in one place. What is the best place for them to meet?2 AnswersThis is a talk-through kind of question, they want you to figure out that what we're trying to do is minimise the total distance travelled to get to the meeting point. If you consider each driver's position as a pair (x,y), then the best place is the the median (x,y) of all positions.I think this question is more about assessing your abstract problem solving; it's not really about distance as the other person said. If all the taxi drivers in a town were to meet in one place, you would need a LOT of parking space....

### Forward Deployed Engineer at Palantir Technologies was asked...

26 Sep 2017
 Imagine a 2D array of non-negative integers representing a map. 0 values are water and non-0 values are land. The land forms islands (contiguous cells vertically or horizontally). The value of an island is the sum of all of its tiles. Efficiently output the size of the highest-valued island.1 AnswerUse numpy argwhere to find all the coords with 1s. Start with that set. Start at a random point and look for if any adjacent coords is contained within all the coords with 1s, record the ones that are in another set. Continue doing this for all "discovered" coords until none is left. Now you have 1 island, compare that to the current highest island mass. Discard if lower, record as the highest if higher. Take the difference between the all coords and the coords of this island and start at a random coord again. Continue doing this until everything's discovered.

### Forward Deployed Software Engineer at Palantir Technologies was asked...

30 Jun 2020
 Asked what I liked about the position and about Palantir1 AnswerI answered that the application of their technology in the area of natural disasters seemed like it has the potential to have a profound impact on relief responses. I also liked the opportunity to travel around Europe.

### Forward Deployed Engineer at Palantir Technologies was asked...

25 Oct 2017
 Typical behavioural questions1 Answerwtf is Decomp? if you have to include it in quotes it is probably worth clarifying

### Forward Deployed Engineer at Palantir Technologies was asked...

5 Nov 2013
 How much water flows under London Bridge in 24 hours?1 AnswerGive a rough estimate for length and depth of the Thames at this point (eg. 100m x 5m). Estimate flow (eg. 1m/s). This gives 100x5x1 m^3 of water per second under the bridge. Extend to 24 hours, convert to litres.

### Forward Deployed Engineer at Palantir Technologies was asked...

1 Apr 2018
 Given a medium sized project, find a bug that was described.1 AnswerTrying to navigate an unknown project on an machine in an unfamiliar IDE.

### Forward Deployed Engineer at Palantir Technologies was asked...

8 Jan 2014
 a) Given a max-heap with N elements, what is the complexity to find the K largest numbers? b) As above, but design an algorithm where the complexity cannot be a function of N (but only K).1 Answera) Normally, this would be K*log(n) as you pick (and hence resort) the heap for every number. b) You can do this in K^2 time by traversing the heap and keeping track of the children of all nodes you've seen, and then picking the next number among those K times.

### Forward Deployed Software Engineer at Palantir Technologies was asked...

30 Jun 2020
 Asked me to complete a live coding challenge using Hackerrank1 AnswerCame close to finding a solution but ultimately not close enough to be considered for the position
110 of 50 Interview Questions