Two interviews were conducted at SSG.

One interview included half an hour of speaking about a university project. This was followed by technical questions, including topics on data structures and operating systems.

The questions were:

1. Given an array with positive and negative numbers, find the maximum range sum.
2. Convert Roman numerals to standard numbers.
3. Implement an LRU cache using a hash table with pointers to a list.

1. Given an array with positive and negative numbers, find the maximum range sum.
2. Convert Roman numerals to our numbers.
3. Implement LRU (using a hash table with pointers to a list).