Render·Software Engineer·Take-home Assignment
Jun 2026
Render gave me a take-home style coding problem centered on rate limiting logic with sliding windows. Two parts, escalating complexity, and you really need to think about efficiency from the start or you'll paint yourself into a corner on part 2.
- Given a sorted in-memory request log with timestamps, IPs, and hostnames, implement a sliding window rate limiter that counts how many requests would be blocked when a per-IP request cap is enforced over the previous T seconds. Blocked requests still count toward future windows.
- Extend the rate limiter to also enforce a per-(IP, host) cap alongside the existing per-IP cap. A request is blocked if either rule triggers, but it only counts as one blocked request even if both rules fire simultaneously. Both counters must still be updated regardless of whether the request was blocked.
“The sliding window boundary being exclusive on both ends tripped me up at first.” The rest of the author's notes on Software Engineer interview at Render, Take-home Assignment round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post