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 ].
What is linked hash set?
Why is hashset used?
What is the use of hashtable?
What do you mean by data types?
How do you check if a stack is empty or not?
Does treeset allow null values?
How do you make a bubble chart with 3 variables?
List the area of applications where stack data structure can be used?
Can arraylist shrink?
Which data structure is applied when dealing with a recursive function?
Who invented quicksort?
Can value be null in treemap?