There were two on-site technical interviews, each with two interviewers.

The interview focused mainly on solving technical programming problems.

I was asked to:

• Implement an LRU cache.
• Calculate the greatest sum of sub-arrays.
• Write a function to translate Roman numerals to decimal numbers.

The interviewers were very kind.

I received a response from HR a few days after each interview, which eventually led to a more than decent job offer, which I accepted.

Given an integer array containing positive and negative numbers, how do you get the maximum sum of its subarrays?

Continuous numbers form a subarray of an array.

For example, if the input array is {1, -2, 3, 10, -4, 7, 2, -5}, the subarray with the maximum sum is {3, 10, -4, 7, 2}, which sums to 18.