Full Stack Senior Software Engineer (Java/J2EE)

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

Let's talk about semaphores. Could you please explain what semaphores are, and how they are used in operating systems or concurrent programming? Provide examples of situations where semaphores are useful for controlling access to shared resources. Explain the difference between binary and counting semaphores. Furthermore, can you discuss potential problems that can arise when using semaphores, such as deadlocks or starvation, and how these problems can be addressed? For instance, consider a scenario where multiple threads need to access a database connection pool. How can semaphores be employed to manage access to the limited number of connections in the pool, preventing overuse and ensuring fair allocation among threads?

Apple

What do you love about working at Apple?