Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Citadel Securities
Colloquio
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
Domande di colloquio [1]
Domanda 1
Graph traversal and Stings and Dynamic programming