find an algorithm for sorting an array in O(n / 2), using your preffered code language. You should find a solution in the exact O(n / 2) proffency. find an algorithm for sorting an array in O(n / 2), using your preffered code language. You should find a solution in the exact O(n / 2) proffency.
Domande di colloquio [1]
Domanda 1
find an algorithm for sorting an array in O(n / 2), using your preffered code language. You should find a solution in the exact O(n / 2) proffency.
Ho presentato la mia candidatura online. La procedura ha richiesto 3 mesi. Ho sostenuto un colloquio presso UPS (Seattle, WA) nel mese di ago 2025
Colloquio
One round with the hiring manager and some senior software developers. Had to redo the first round again because of some changes and reorgs. Whole process took from May to August.
It was very easy, with three stages....basic knowledge is enough, Aptitude, 2 technical hr rounds and then one final hr........the interview was pretty easy, due to limited slots my selection was not done.