Product Manager, Local Search Ads

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 rate limiter. This is a crucial component in many systems to prevent abuse and ensure fair usage. Your rate limiter should meet these requirements: Functionality: It should limit the number of requests a user can make within a specific time window. For example, allow a user to make 10 requests per minute. Scalability: The rate limiter needs to handle a large number of users and requests concurrently. Imagine millions of users accessing the system. Accuracy: It should accurately track and enforce the rate limits. A small degree of error is acceptable, but significant deviations are not. Low Latency: The rate limiter must not introduce significant delays in request processing. The overhead should be minimal. Fault Tolerance: The system should continue to function correctly even if some components fail. It should be resilient to outages. Cost-Effectiveness: The solution should be cost-effective in terms of resources used (e.g., memory, CPU, network bandwidth). Consider these scenarios and constraints: Users are identified by a unique ID. The time window is configurable (e.g., seconds, minutes, hours). The rate limit is also configurable per user or group of users. You can use any data structures and algorithms you deem appropriate. Assume you have access to a distributed cache (e.g., Redis, Memcached). Walk me through your design. Discuss different approaches, their trade-offs, and how you would address the requirements. Specifically, consider the following: Data structures for storing request counts. Algorithms for incrementing and checking request counts. Handling concurrency and race conditions. Strategies for distributing the rate limiter across multiple servers. How to handle exceeding the rate limit (e.g., returning an error code). Monitoring and alerting. For example, if a user with ID user123 tries to make 11 requests within a minute when their limit is 10, the rate limiter should reject the 11th request. How would your system achieve this efficiently and reliably at scale?

Google

Where do you see yourself in 5 years?