Software Engineer New Grad

Input: An array with strings of "<client name> <timestamp>", and a number "Y" of maximum requests per minute per client

Criteria 1: If a client issues too many requests to the server (> Y), the excessive requests would be regarded as overflow and dropped.
Criteria 2: In a window of 5 minutes and total requests in the

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

request per user, 1 hashmap to count the request in the time window, and 1 hashmap to parse the vector of string to the vector of timestamp per user.
O(M) space complexity, O(M) Time complexity.