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 ].

980

What does arraylist remove do?

998

Does concurrenthashmap allow null?

926

What is binary tree give example?

918

Can we put null key in hashmap?

892

What does bubble sort do?

798

How to get the index of an array element?

1049

What are the tasks performed while traversing a binary tree?

1132

How do you explain bubble sort?

874

Can you list out the areas in which data structures are applied extensively?

1011

Is treemap sorted?

955

what is the difference between Linear Array and Linked List?

1041

Define in brief an array. What are the types of array operations?

1198

What is the best data structure and algorithm to implement cache?

954

Name few collections map implementations?

886