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
- 970 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Which interfaces are implemented by concurrentskiplistset?
What the principle of quick sort and its complexity?
Is radix sort faster than quicksort?
Where is binary tree used?
What is an ordered map?
What are the advantages of merge sort?
Define in brief an array.
What do you know about traversal in linked lists?
Is tuple immutable?
Sort the given values using Quick Sort? 65 70 75 80 85 60 55 50 45
Describe the types of data structures?
What are the advantages of data structure?
Windows 
