How can we remove loops in a linked list? What are the functions of fast and slow pointers?
What do you mean by shortest path?
What is the default capacity of hashmap?
Explain the common uses of tree database.
Does treemap allow null key?
Explain quick sort?
If I try to add enum constants to a treeset, what sorting order will it use?
What are the types of queues?
What do you mean by double hashing?
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
How do you sort an arraylist?
Explain extended binary tree.
Why do we use arrays?