Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso HARMAN (Bucarest, ) nel mese di apr 2018
Colloquio
Difficulty: easy to medium
10 Questions about: graphs, trees, sorting algorithms, prime numbers, divide et impera (binary search), OOP theoretical questions (polymorphism, inheritance, abstract classes, interfaces)
Domande di colloquio [1]
Domanda 1
What does virtual keyword represent in C++?
Write a program which prints all the prime numbers lower than a given number.
Given a 1024 storey building and a toy, what is the minimum number of throws to find out the storey at which if the toy is dropped, it won't break.
