Rate Limiter
Allow at most N requests per time window โ the logic behind every API.
Project 11Advanced
๐งฉ Problem statement
Allow at most N requests per time window โ the logic behind every API. Design it completely in pseudocode first: plan the data, split the work into functions, write the logic, dry-run it and test it.
๐ Requirements
- Time windows
- Counters
- State
- Queue of timestamps
๐ฅ Inputs
- Request times
๐ค Outputs
- Allowed / blocked for each request
๐ Rules
- At most 5 requests in any 10-second window
๐ง Constraints
- Times arrive in increasing order
๐งญ Suggested approach
- Restate the problem in your own words
- List the data you must remember (variables, lists, maps)
- Write one FUNCTION per feature
- Write the main program that calls them
- Dry-run with the Run button
- Test normal cases and edge cases
๐ง Required concepts
- Data structures
- Algorithms
- Complexity
โ๏ธ Pseudocode editor ยท dry-run tool ยท test cases
Design your solution here. Use Run to dry-run it step by step. Hints unlock one at a time โ try on your own first!
๐งช Edge cases to test
- Empty input
- Very large values
- Repeated or duplicate entries
๐ Challenge extensions
- Add a feature of your own
- Make it work for 10ร more data โ what changes?
