Silicon Validation Engineer

Apple

Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. You must implement a solution with a linear runtime complexity and use only constant extra space. For example, if the input is nums = [2,2,3,2], the output should be 3. Another example, if the input is nums = [0,1,0,1,0,1,99], the output should be 99. How do you solve this problem, considering edge cases like empty input, presence of zero, and negative numbers?

Apple

Let's design a system for URL shortening, like TinyURL. Assume a large-scale service. Please consider the following aspects in your design: Functional Requirements: The system should generate shorter URLs (a.k.a. short links) given longer URLs. Users should be able to navigate to the original URL by entering the short link in their browser. The system should be highly available. Non-Functional Requirements: The system should have low latency for both URL shortening and redirection. Short links should be relatively short (e.g., 6-8 characters). The system should be able to handle a large number of URL shortening and redirection requests. Capacity Estimation: Assume 100 million URLs are shortened per day. Assume 1 billion URL redirections per day. Estimate storage requirements for 5 years. Design Considerations: How would you generate unique short links? What data structures and databases would you use to store the URL mappings? How would you handle collisions when generating short links? How would you optimize for low latency redirection? How would you scale the system to handle the expected traffic? Walk me through your design, explaining your choices and the trade-offs you considered. Provide diagrams where necessary to illustrate the architecture.

Apple

What do you love about working at Apple?