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
- 991 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Which data structures are used in bfs and dfs algorithm?
Define a stack?
Explain the difference between hashset and hashmap?
How do you determine if a binary tree is height balanced?
Can you list out the areas in which data structures are applied extensively?
Why do we Use a Multidimensional Array?
What is an expression tree?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
Describe full binary tree and complete binary tree.
Explain the priority queue?
What is the minimization factor and time complexity of b-tree?
Describe the level term in a tree.
Windows 
