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
- 1025 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
To describe the Complexity of Binary search, Quicksort and various other sorting and searching techniques..
0 Answers HPCL, Hughes Systique Corporation,
Define back edge?
What are the differences between b tree and b+ tree?
What can be stored in an arraylist?
What is the difference between a hashmap and hashtable?
What is the idea behind splaying?
How to increase stack limit in w3wp.exe?
Explain what is B-tree?
Explain what are the major data structures used in the hierarchical data model?
Why is an array homogeneous?
What is entryset in hashmap?
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
Windows 
