Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Citadel nel mese di apr 2025
Colloquio
an online assessment with 2 coding questions, both were fairly standard programming tasks. I can't replicate them in words but I can give a general direction. They were leetcode style.
Domande di colloquio [2]
Domanda 1
A leetcode question on DFS and with memoization. Given an undirected tree, You're asked to find the maximum node value sum on any path (path comprising of connected nodes) which goes in one direction (in other words, two nodes in the path don't have the same height or depth)
A binary search question where it's tricky to find whether it indeed is binary search. but it is. you have to binary search on the final answer (low= 0 and high = 1e9 guessed as per the variable constraints) and the final answer is calculated in n log n