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
- 1029 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Is hashmap keyset ordered?
List the data structures which are used in network data modal.
What are vectors used for in real life?
Is linked list faster than array?
What is complete binary tree in data structure?
Differentiate between list and set.
Why is hashing used?
How do you declare A pointer to array of three chars
Can you sort a hashset?
What is the best case complexity of bubble sort?
Run time memory allocation is known as ?
What is array and its types in data structure?
Windows 
