Interested to Buy Any Domain ? << Click Here >> for more details...
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
- 0 Answers
- 975 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Explain about Merge Sort?
Is pointer a variable in data structure?
Does hashmap allow duplicate keys?
Can array store heterogeneous data?
Tell me about the different sorting techniques.
Which interfaces are implemented by abstractsequentiallist?
How does a treemap work?
Is hashmap ordered?
What is the default value of Array?
When would you use a tuple?
What are the applications of stack?
How many null values are allowed in hashmap?
Windows 
