Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Altera (Toronto, ON) nel mese di feb 2025
Colloquio
Coding first, then BH. Starting from 30 min with two employees in different teams online. Each of them will give two questions from easy to midium leetcode level. C++ strongly prefered and usually based on dynamic programming and graph theory.
Domande di colloquio [1]
Domanda 1
Use the fast method to find the minimum number in a tree, which the elements of deepth n was 2n + 1, two node above can point to the same node in the next level when they are neighbour.