Embedded Senior Software Engineer, Pixel Power Software

Google

Imagine you are developing a racing game. You need to implement a system that determines the placement of each car in the race at any given moment. The race track is a circular track of a fixed length. Each car has a unique ID and a current distance traveled from the starting line. Design a function that takes a list of cars, where each car is represented by its ID and distance traveled, and returns the current placement of each car, considering the circular nature of the track. For example, if the track length is 1000 meters and a car has traveled 1200 meters, its actual position on the track is 200 meters. Consider edge cases such as multiple cars having the same position. Can you implement a function that efficiently calculates and assigns placements to the cars based on their positions on the track?

Google

Let's design a cache. Consider the following requirements: Basic Functionality: Implement a cache with put(key, value) and get(key) methods. Eviction Policy: Implement an LRU (Least Recently Used) eviction policy. When the cache is full, the least recently accessed item should be evicted to make space for the new item. Thread Safety: Ensure the cache is thread-safe to handle concurrent access from multiple threads. Generics: The cache should be able to store any type of key and value (using generics). Time Complexity: get and put operations should have an average time complexity of O(1). Example Usage: Cache cache = new Cache(5); // Cache with capacity 5 cache.put(1, one); cache.put(2, two); cache.get(1); // Access key 1, moves it to the most recently used cache.put(3, three); cache.put(4, four); cache.put(5, five); cache.put(6, six); // This will evict key 2 (LRU) System.out.println(cache.get(2)); // Output: null (because it was evicted) Discuss the data structures you would use, the implementation details for each method, and how you would address thread safety.

Google

Where do you see yourself in 5 years?