K49
Token Bucket Rate Limiter
Problem Statement & Objective
Simulate a token bucket algorithm for API request throttling with burst allowance.
Function Signature (Python)
token_bucket_rate_limiter(capacity: int, refill_rate: int, requests: list) -> list[bool]Input & Output Contract
Output Rule:Her istek için kabul/ret (True/False) sonucu listesi.
System Constraints
1 <= kapasite <= 10^6
1 <= dolum_hizi <= 10^6
0 <= zaman <= 10^8
1 <= maliyet <= kapasite
İstek zamanları monoton artandırExample Execution Walkthrough
kapasite = 5, dolum_hizi = 1, istekler = [[0, 3], [0, 3], [2, 3]]
0. sn: 5 token var. İstek 3 token -> Kabul, kalan 2 token.
0. sn: 2 token var. İstek 3 token -> Ret, kalan 2 token.
2. sn: 2 sn geçti, +2 token -> 4 token var. İstek 3 token -> Kabul, kalan 1 token.
Cevap: [True, False, True]Example Test Scenarios (3)
Example 1: Temel Kova
Input:
[5,1,[[0,3],[0,3],[2,3]]]Expected Output:
[true,false,true]Example 2: Kapasite Tüketimi
Input:
[10,2,[[1,5],[1,5],[1,1]]]Expected Output:
[true,true,false]Example 3: Tam Dolum
Input:
[3,5,[[0,2],[10,3]]]Expected Output:
[true,true]