Flipkart Customer ID Longest Consecutive Sequence
Flipkart Customer ID Longest Consecutive Sequence
MediumHash Maps0% accepted
Flipkart has customer IDs as integers. Find the length of the longest consecutive sequence in O(n) time.
Approach
Find longest consecutive sequence length in O(n) using a hash set.
Input
6
100 4 200 1 3 2
Output
4
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