filmov
tv
Find duplicates in O(n) time and O(1) extra space
Показать описание
This is gfg question that has been asked in faang interview:-
Given an array of n elements that contains elements from 0 to n-1, with any of these numbers appearing any number of times.
Find these repeating numbers in O(n) and use only constant memory space.
Note: The repeating element should be printed only once.
Example:
Input: n=7 , array[]={1, 2, 3, 6, 3, 6, 1}
Output: 1, 3, 6
Explanation: The numbers 1 , 3 and 6 appears more than once in the array.
Input : n = 5 and array[] = {1, 2, 3, 4 ,3}
Output: 3
Explanation: The number 3 appears more than once in the array.
similar question on leetcode:
Given an array of n elements that contains elements from 0 to n-1, with any of these numbers appearing any number of times.
Find these repeating numbers in O(n) and use only constant memory space.
Note: The repeating element should be printed only once.
Example:
Input: n=7 , array[]={1, 2, 3, 6, 3, 6, 1}
Output: 1, 3, 6
Explanation: The numbers 1 , 3 and 6 appears more than once in the array.
Input : n = 5 and array[] = {1, 2, 3, 4 ,3}
Output: 3
Explanation: The number 3 appears more than once in the array.
similar question on leetcode:
0:06:48
0:05:10
0:13:17
0:08:40
0:19:48
0:06:13
0:01:05
0:11:24
2:40:03
0:09:48
0:09:36
0:16:29
0:09:40
0:08:07
0:07:49
0:09:48
0:15:38
0:15:00
0:12:37
0:43:28
0:20:02
0:15:59
0:04:11
0:06:49