employer cover photo
employer logo
employer logo

Palantir Technologies

Questa è la tua azienda?

Domanda di colloquio di Palantir Technologies

Find strongly connected components in a graph (use DFS or BFS)

Risposte di colloquio

Anonimo

20 giu 2015

To find strongly connected components in a directed graph, one could use Rao Kosaraju's algorithm. To find connected components in an undirected graph, simple BFS from all non-explored vertices is enough.

Anonimo

23 gen 2021

There's a lot of elements to typically cover in these questions, clarifications, scoping, making sure you're answering the actual question the interviewer is looking for you to answer, etc. Could be worth doing a mock interview with one of the Prepfully Palantir Engineering experts... they've worked in the role so they clearly know how to get through the interview. prepfully.com/practice-interviews