Tech Lead, Software Engineering, People with Disabilities

Google

Tic-tac-toe is played by two players A and B on a 3 x 3 grid. The rules of Tic-Tac-Toe are: Players take turns placing characters into empty squares ''. The first player A always places 'X' characters, while the second player B always places 'O' characters. 'X' and 'O' characters are always placed into empty squares, never on filled ones. The game ends when there are three of the same (non-empty) character filling any row, column, or diagonal. The game also ends if all squares are non-empty. No more moves can be played if the game is over. Given a 2D integer array moves where moves[i] = [rowi, coli] indicates that the ith move will be played on gridrowi. return the winner of the game if it exists (A or B). In case the game ends in a draw return Draw. If there are still movements to play return Pending. You can assume that moves is valid (i.e., it follows the rules of Tic-Tac-Toe), the grid is initially empty, and A will play first. For example: moves = [[0,0],[2,0],[1,1],[2,1],[2,2]] Output: A moves = [[0,0],[1,1],[0,1],[0,2],[1,0],[2,0]] Output: B moves = [[0,0],[1,1],[2,0],[1,0],[1,2],[2,1],[0,1],[0,2],[2,2]] Output: Draw

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

Describe a time you faced a tough technical problem. What made it so difficult, and how did you approach solving it? What resources did you consult, and what was the final outcome? What did you learn from this experience, and how has it shaped your problem-solving skills since then? For example, perhaps you were tasked with optimizing a slow-running query in a large database. The initial attempts to improve performance, such as adding indexes, didn't yield the desired results. You then had to dive deep into the query execution plan, identify bottlenecks, and rewrite the query using more efficient techniques, like leveraging window functions or temporary tables. You could also describe the challenges faced while integrating a new feature into a legacy system with poorly documented code. You might have had to reverse engineer parts of the system, deal with unexpected dependencies, and carefully test the integration to avoid breaking existing functionality. Elaborate on the specific tools and methodologies you employed during these challenges, such as debuggers, profilers, or version control systems. Also, explain how you collaborated with team members or sought assistance from external resources like online forums or documentation to overcome the obstacles.