The given scenario is: There is a container that is open from both ends and that always is in sorted order. To insert an element, its position is determined, then each of the elements to the left or right of that position is removed. The new element is inserted, then the removed elements are added back. Each removal or insertion is an operation. Determine the minimum number of operations after inserting a list of integers into an empty list.
Domande di colloquio [1]
Domanda 1
The given scenario is: There is a container that is open from both ends and that always is in sorted order. To insert an element, its position is determined, then each of the elements to the left or right of that position is removed. The new element is inserted, then the removed elements are added back. Each removal or insertion is an operation. Determine the minimum number of operations after inserting a list of integers into an empty list.
Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso WorldQuant (Budapest) nel mese di set 2023
Colloquio
Many rounds, most of them properly arranged, quite difficult, kind also.
There was one with a guy who had no idea why to interview me.
Long process (6 rounds), no offer.
Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso WorldQuant (Melbourne) nel mese di ott 2021
Colloquio
Applied online first, then got an online test on HankerRank. 4 Questions in one hour, at least one should be implemented in C++. Available language: Python, C/C++. Not got the second interview yet.
Domande di colloquio [1]
Domanda 1
Sorting, dynamic programing x2 , two sum like problem,
