Envié una solicitud electrónica. Acudí a una entrevista en Citadel Securities
Entrevista
The OA was extremely tough. Questions were on DP and graph. The graph question was to find the longest path form one bode to any other node in the graph. The dp question was a string question on prefix and suffix
Preguntas de entrevista [1]
Pregunta 1
Graph traversal and Stings and Dynamic programming