"Companies count on managers to make smart team decisions and oversee group members in order to maintain deadlines and keep operations running smoothly. Be prepared to answer several situational questions that will evaluate your time management skills, problem solving abilities, and ease in leading a team. Employers will also expect you to be well-versed in products and operations, so make sure to brush up on the department's relevant work."
Find the largest possible difference in an array of integers, such that the smaller integer occurs earlier in the array.
Looks like an Divide & Conquer algorithm.
Build an array max where at each index i max[i] is the highest value to the right of i in the original array. Then iterate over the original array and compute max[i]-orig[i] and return the highest of these values. Requires space and time linear in the length of the array.
Iterate over the list, updating two variables each time: the minimum element seen so far and the maximum difference possible so far (calculated as the max of the current max difference and the difference of the current element and the current known minimum). This works in O(n) time with O(1) storage.