Engineering Project/Program Manager, IS&T Enterprise Systems

Apple

Given a string expression of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. You may return the answer in any order. The test cases are generated such that the output values fit in a 32-bit integer and the number of different results does not exceed 104. For example: If the input is expression = 2-1-1 The expected output is [0,2] Because: ((2-1)-1) = 0 (2-(1-1)) = 2 If the input is expression = 23-45 The expected output is [-34,-14,-10,-10,10] Because: (2(3-(45))) = -34 ((23)-(45)) = -14 ((2(3-4))5) = -10 (2((3-4)5)) = -10 (((23)-4)5) = 10 Constraints: 1 <= expression.length <= 20 expression consists of digits and the operator '+', '-', and '*'. All the integer values in the input expression are in the range [0, 99]. The integer values in the input expression do not have a leading '-' or '+' denoting the sign.

Apple

Design an API to display the total number of iOS downloads from different devices in a graph.

Apple

Let's explore your resume and then dive into a coding question. First, regarding your resume: Could you walk me through a project that you are particularly proud of? Describe your role, the challenges you faced, and the solutions you implemented. Be specific about the technologies you used and the impact your contributions had on the project's outcome. Tell me about a time you had to work with a technology or framework that you were unfamiliar with. How did you approach learning it, and how did you apply it to the project at hand? What resources did you find most helpful, and what challenges did you encounter during the learning process? Describe a situation where you had to make a trade-off between different approaches or technologies. What factors did you consider when making your decision, and how did you evaluate the potential consequences of each option? Can you provide a specific example of such a trade-off? Now, for the coding question: Given a list of integers, write a function to find the contiguous sub-array with the largest sum. For example, if the input is [-2, 1, -3, 4, -1, 2, 1, -5, 4], the output should be [4, -1, 2, 1], with a sum of 6. Explain your approach, and provide a working implementation of the function in your preferred programming language. Consider edge cases such as an empty input list or a list with only negative numbers. What is the time complexity of your solution? Can you optimize it further?