mirror of
https://github.com/harivansh-afk/veet-code.git
synced 2026-04-17 16:02:43 +00:00
problems
This commit is contained in:
parent
76062021e9
commit
c548626d7f
13 changed files with 570 additions and 1 deletions
47
problems/hard/lru-cache/solution.py
Normal file
47
problems/hard/lru-cache/solution.py
Normal file
|
|
@ -0,0 +1,47 @@
|
|||
"""
|
||||
LRU Cache
|
||||
|
||||
You're building a caching layer for a database-heavy web application.
|
||||
To reduce load, implement a Least Recently Used (LRU) cache that
|
||||
automatically evicts the oldest unused entries when capacity is reached.
|
||||
|
||||
Example 1:
|
||||
cache = LRUCache(capacity=2)
|
||||
cache.put("a", 1)
|
||||
cache.put("b", 2)
|
||||
cache.get("a") # Returns 1 (a is now most recently used)
|
||||
cache.put("c", 3) # Evicts "b" (least recently used)
|
||||
cache.get("b") # Returns -1 (not found)
|
||||
cache.get("c") # Returns 3
|
||||
|
||||
Example 2:
|
||||
cache = LRUCache(capacity=1)
|
||||
cache.put("x", 10)
|
||||
cache.put("y", 20) # Evicts "x"
|
||||
cache.get("x") # Returns -1
|
||||
cache.get("y") # Returns 20
|
||||
|
||||
Constraints:
|
||||
- capacity >= 1
|
||||
- Keys are strings, values are integers
|
||||
- get() returns -1 if key not found
|
||||
- put() updates value if key exists (and marks as recently used)
|
||||
- Both get() and put() should be O(1) average time
|
||||
"""
|
||||
|
||||
|
||||
class LRUCache:
|
||||
"""Least Recently Used cache with O(1) operations."""
|
||||
|
||||
def __init__(self, capacity: int):
|
||||
"""Initialize cache with given capacity."""
|
||||
pass # Your implementation here
|
||||
|
||||
def get(self, key: str) -> int:
|
||||
"""Return value for key, or -1 if not found."""
|
||||
pass # Your implementation here
|
||||
|
||||
def put(self, key: str, value: int) -> None:
|
||||
"""Insert or update key-value pair, evicting LRU if needed."""
|
||||
pass # Your implementation here
|
||||
|
||||
86
problems/hard/lru-cache/tests.py
Normal file
86
problems/hard/lru-cache/tests.py
Normal file
|
|
@ -0,0 +1,86 @@
|
|||
"""Tests for lru-cache."""
|
||||
import pytest
|
||||
from solution import LRUCache
|
||||
|
||||
|
||||
class TestBasicCases:
|
||||
"""Test basic functionality with typical inputs."""
|
||||
|
||||
def test_basic_put_get(self):
|
||||
"""Test basic put and get operations."""
|
||||
cache = LRUCache(2)
|
||||
cache.put("a", 1)
|
||||
cache.put("b", 2)
|
||||
assert cache.get("a") == 1
|
||||
assert cache.get("b") == 2
|
||||
|
||||
def test_eviction_lru(self):
|
||||
"""Test that least recently used is evicted."""
|
||||
cache = LRUCache(2)
|
||||
cache.put("a", 1)
|
||||
cache.put("b", 2)
|
||||
cache.get("a") # a is now most recent
|
||||
cache.put("c", 3) # b should be evicted
|
||||
assert cache.get("b") == -1
|
||||
assert cache.get("a") == 1
|
||||
assert cache.get("c") == 3
|
||||
|
||||
def test_update_existing_key(self):
|
||||
"""Test updating an existing key."""
|
||||
cache = LRUCache(2)
|
||||
cache.put("a", 1)
|
||||
cache.put("a", 10)
|
||||
assert cache.get("a") == 10
|
||||
|
||||
|
||||
class TestEdgeCases:
|
||||
"""Test edge cases and boundary conditions."""
|
||||
|
||||
def test_capacity_one(self):
|
||||
"""Test with capacity of 1."""
|
||||
cache = LRUCache(1)
|
||||
cache.put("a", 1)
|
||||
cache.put("b", 2)
|
||||
assert cache.get("a") == -1
|
||||
assert cache.get("b") == 2
|
||||
|
||||
def test_get_nonexistent(self):
|
||||
"""Test getting a key that doesn't exist."""
|
||||
cache = LRUCache(2)
|
||||
assert cache.get("missing") == -1
|
||||
|
||||
def test_put_updates_recency(self):
|
||||
"""Test that put on existing key updates recency."""
|
||||
cache = LRUCache(2)
|
||||
cache.put("a", 1)
|
||||
cache.put("b", 2)
|
||||
cache.put("a", 10) # a is now most recent
|
||||
cache.put("c", 3) # b should be evicted
|
||||
assert cache.get("b") == -1
|
||||
assert cache.get("a") == 10
|
||||
|
||||
def test_many_operations(self):
|
||||
"""Test a sequence of many operations."""
|
||||
cache = LRUCache(3)
|
||||
cache.put("a", 1)
|
||||
cache.put("b", 2)
|
||||
cache.put("c", 3)
|
||||
cache.get("a")
|
||||
cache.put("d", 4) # evicts b
|
||||
cache.put("e", 5) # evicts c
|
||||
assert cache.get("a") == 1
|
||||
assert cache.get("b") == -1
|
||||
assert cache.get("c") == -1
|
||||
assert cache.get("d") == 4
|
||||
assert cache.get("e") == 5
|
||||
|
||||
def test_get_updates_recency(self):
|
||||
"""Test that get updates the access order."""
|
||||
cache = LRUCache(2)
|
||||
cache.put("a", 1)
|
||||
cache.put("b", 2)
|
||||
cache.get("a") # touch a
|
||||
cache.put("c", 3) # evicts b, not a
|
||||
assert cache.get("a") == 1
|
||||
assert cache.get("b") == -1
|
||||
|
||||
49
problems/hard/rate-limiter/solution.py
Normal file
49
problems/hard/rate-limiter/solution.py
Normal file
|
|
@ -0,0 +1,49 @@
|
|||
"""
|
||||
Rate Limiter
|
||||
|
||||
You're building an API gateway for a SaaS platform. To prevent abuse
|
||||
and ensure fair usage, you need to implement a rate limiter that tracks
|
||||
requests per user using a sliding window algorithm.
|
||||
|
||||
The limiter should allow at most `max_requests` per user within any
|
||||
`window_seconds` time period.
|
||||
|
||||
Example 1:
|
||||
limiter = RateLimiter(max_requests=3, window_seconds=60)
|
||||
limiter.allow_request("user1", timestamp=0) # True (1st request)
|
||||
limiter.allow_request("user1", timestamp=30) # True (2nd request)
|
||||
limiter.allow_request("user1", timestamp=45) # True (3rd request)
|
||||
limiter.allow_request("user1", timestamp=50) # False (limit reached)
|
||||
limiter.allow_request("user1", timestamp=61) # True (1st expired)
|
||||
|
||||
Example 2:
|
||||
limiter = RateLimiter(max_requests=2, window_seconds=10)
|
||||
limiter.allow_request("user1", timestamp=0) # True
|
||||
limiter.allow_request("user2", timestamp=0) # True (different user)
|
||||
limiter.allow_request("user1", timestamp=5) # True
|
||||
limiter.allow_request("user1", timestamp=8) # False
|
||||
|
||||
Constraints:
|
||||
- max_requests >= 1
|
||||
- window_seconds >= 1
|
||||
- Timestamps are non-negative integers (seconds)
|
||||
- Timestamps are non-decreasing per user
|
||||
- user_id is a non-empty string
|
||||
"""
|
||||
|
||||
|
||||
class RateLimiter:
|
||||
"""Sliding window rate limiter for API request throttling."""
|
||||
|
||||
def __init__(self, max_requests: int, window_seconds: int):
|
||||
"""Initialize with request limit and time window."""
|
||||
pass # Your implementation here
|
||||
|
||||
def allow_request(self, user_id: str, timestamp: int) -> bool:
|
||||
"""Return True if request allowed, False if rate limited."""
|
||||
pass # Your implementation here
|
||||
|
||||
def get_remaining(self, user_id: str, timestamp: int) -> int:
|
||||
"""Return remaining requests allowed for user at timestamp."""
|
||||
pass # Your implementation here
|
||||
|
||||
70
problems/hard/rate-limiter/tests.py
Normal file
70
problems/hard/rate-limiter/tests.py
Normal file
|
|
@ -0,0 +1,70 @@
|
|||
"""Tests for rate-limiter."""
|
||||
import pytest
|
||||
from solution import RateLimiter
|
||||
|
||||
|
||||
class TestBasicCases:
|
||||
"""Test basic functionality with typical inputs."""
|
||||
|
||||
def test_allow_within_limit(self):
|
||||
"""Test requests within the limit are allowed."""
|
||||
limiter = RateLimiter(max_requests=3, window_seconds=60)
|
||||
assert limiter.allow_request("user1", 0) == True
|
||||
assert limiter.allow_request("user1", 30) == True
|
||||
assert limiter.allow_request("user1", 45) == True
|
||||
|
||||
def test_block_over_limit(self):
|
||||
"""Test requests over limit are blocked."""
|
||||
limiter = RateLimiter(max_requests=2, window_seconds=60)
|
||||
assert limiter.allow_request("user1", 0) == True
|
||||
assert limiter.allow_request("user1", 30) == True
|
||||
assert limiter.allow_request("user1", 45) == False
|
||||
|
||||
def test_multiple_users_independent(self):
|
||||
"""Test each user has independent limits."""
|
||||
limiter = RateLimiter(max_requests=1, window_seconds=60)
|
||||
assert limiter.allow_request("user1", 0) == True
|
||||
assert limiter.allow_request("user2", 0) == True
|
||||
assert limiter.allow_request("user1", 30) == False
|
||||
assert limiter.allow_request("user2", 30) == False
|
||||
|
||||
def test_get_remaining_basic(self):
|
||||
"""Test remaining count decreases with requests."""
|
||||
limiter = RateLimiter(max_requests=3, window_seconds=60)
|
||||
assert limiter.get_remaining("user1", 0) == 3
|
||||
limiter.allow_request("user1", 0)
|
||||
assert limiter.get_remaining("user1", 0) == 2
|
||||
|
||||
|
||||
class TestEdgeCases:
|
||||
"""Test edge cases and boundary conditions."""
|
||||
|
||||
def test_window_expiration(self):
|
||||
"""Test old requests expire from window."""
|
||||
limiter = RateLimiter(max_requests=2, window_seconds=60)
|
||||
assert limiter.allow_request("user1", 0) == True
|
||||
assert limiter.allow_request("user1", 30) == True
|
||||
assert limiter.allow_request("user1", 45) == False
|
||||
assert limiter.allow_request("user1", 61) == True
|
||||
|
||||
def test_single_request_limit(self):
|
||||
"""Test with limit of 1 request."""
|
||||
limiter = RateLimiter(max_requests=1, window_seconds=10)
|
||||
assert limiter.allow_request("user1", 0) == True
|
||||
assert limiter.allow_request("user1", 5) == False
|
||||
assert limiter.allow_request("user1", 11) == True
|
||||
|
||||
def test_new_user_full_allowance(self):
|
||||
"""Test new users start with full allowance."""
|
||||
limiter = RateLimiter(max_requests=5, window_seconds=60)
|
||||
limiter.allow_request("user1", 0)
|
||||
assert limiter.get_remaining("new_user", 20) == 5
|
||||
|
||||
def test_rapid_same_timestamp(self):
|
||||
"""Test multiple requests at same timestamp."""
|
||||
limiter = RateLimiter(max_requests=3, window_seconds=1)
|
||||
assert limiter.allow_request("user1", 0) == True
|
||||
assert limiter.allow_request("user1", 0) == True
|
||||
assert limiter.allow_request("user1", 0) == True
|
||||
assert limiter.allow_request("user1", 0) == False
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue