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

Question

Sigiloso · Accepted Answer

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.

Sigiloso · Answer

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

Palantir Technologies

Pergunta de entrevista da empresa Palantir Technologies

Respostas da entrevista

Empresas seguidas

Buscas de vagas