PhonePe Duplicate Transaction IDs
PhonePe Duplicate Transaction IDs
MediumHash Maps0% accepted
PhonePe audits transaction IDs in range [1,n]. Given array of n integers where each integer is in [1,n], find all elements that appear twice. Solve in O(n) time and O(1) extra space.
Approach
Find all duplicates in array where values are in [1,n], O(n) time O(1) space.
Input
8
4 3 2 7 8 2 3 1
Output
[2,3]
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