Skip to content

Conversation

rishabh-kothari
Copy link

In the given problem an array is given with elements in range [1,n] where n= size of the array -1.
In the array only single element is repeating two or more times.
We find that duplicate element in o(n) time and using o(1) space by using cycle detection algorithm.

In the given problem an array is given with elements in range [1,n] where n= size of the array -1.
In the array only single element is repeating two or more times. 
We find that duplicate element in o(n) time and using o(1)  space by using cycle detection algorithm.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant