Aadhaar Authentication Flood Check
Aadhaar Authentication Flood Check
HardHash Maps100% accepted
Given authentication events as [id, timestamp] pairs, a threshold T and window width W, find all ids that have MORE than T events within some inclusive time window [t, t+W]. Return the flagged ids sorted.
Approach
Given N authentication events (aadhaar_id, timestamp), find all aadhaar IDs that exceed T requests in any window of W seconds.
Input
[[["X", 1], ["X", 3], ["X", 6]], 2, 5]
Output
["X"]
More Hash Maps problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards