← Flipkart questions

Find duplicates in an array in O(n) time and O(1) space

Filed under Flipkart

Given an array of n elements containing integers between 0 and n-1, find all the duplicate elements present in the array with an optimal time complexity of O(n) and space complexity of O(1).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Flipkart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.