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 ].
No Answer is Posted For this Question
Be the First to Post Answer
Is char array null terminated?
What is perfect binary tree?
Why arraylist is not efficient for manipulation?
Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.
How many types of lists are there?
How do you define a set?
Is it possible to make an array volatile in java?
How do I rearrange rows in numbers?
How to find 3rd element from end in a linked list in one pass?
Differentiate between arraylist and vector.
Is queue fifo or lifo?
List the area of applications of data structure.