Senior Software Engineer, Google Cloud Platform Security UI

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

Tell me about a time you had to sign a non-disclosure agreement (NDA). What were the key terms, and how did you ensure compliance while working on the project? Consider these points in your answer: Context: Briefly describe the project and the purpose of the NDA. Who were the parties involved, and what information was being protected? Key Terms: What were the most important clauses or restrictions outlined in the NDA? This could include limitations on sharing information, reverse engineering, or using the protected information for purposes outside the scope of the agreement. Compliance Measures: What specific steps did you take to ensure you and your team complied with the NDA? Did you implement any specific procedures, such as data encryption, access controls, or regular training? Challenges: Did you face any challenges in adhering to the NDA? If so, how did you overcome them? Did you need to seek clarification on any terms or consult with legal counsel? Outcome: What was the result of the project, and how did the NDA contribute to its success? Did the NDA effectively protect the confidential information, and were there any lessons learned from the experience? For example, perhaps you worked on a project involving a new algorithm for a company. The NDA might have restricted you from sharing the algorithm with anyone outside the project team, reverse engineering it, or using it for any other projects. You might have implemented access controls to limit who could access the algorithm's source code and conducted regular training sessions to remind the team of their obligations under the NDA. You should talk about how you proactively avoided violations and made sure your actions were fully within the legal scope of the agreement.