Sollicitatievragen voor Software engineer gedeeld door sollicitanten
Given a linked list of length n, and without creating any secondary data structures, how would you find an entry in the linked list in less than n probes? How would you improve or refactor this section of code from the coding challenge?
The test was in form of a code sample printed on paper, where a number of issues where present. I had to identify the issues, and explain why they were such and how they could be remedied.
Example of a question during the Orientation Interview: Given a large list of values, how can you find the number of all entries which are identical? What is the Big O complexity of your solution?