Available question text
Design a Router that stores up to memoryLimit packets in FIFO order, rejects duplicates (same source, destination, timestamp), evicts the oldest packet when full, and forwards/removes packets in FIFO order. Support getCount(destination, startTime, endTime) to count currently stored packets for a destination in a timestamp range; note that addPacket calls come in non-decreasing timestamp order, enabling efficient per-destination range counting.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3508. Implement Router
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source