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.

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.

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.