Data Structures Interview Questions

“tell me about tree spanning algorithms”

Answer Question

“HashMap implementation”

Answer Question

“Given array of n integers and given a number X, find all the unique pairs of elemens (a,b), whoose some is equal to X.”

View Answers (1)

“Design an LRU cache”

View Answers (1)

“How to design a good hash function if the key is a person`s name”

Answer Question

“How do you reverse a linked list”

View Answers (1)

“3. Trees (binary and otherwise) form the basis of many common data structures.
Please describe some of these data structures and when they might be used.”

View Answers (1)

“2. Implement the following interface to implement a binary search tree in Java

public interface BinaryTree<T extends Comparable<? super T>>
{
    public void insert(T data);
    public T findMin();
    public boolean contains(T data);
    public void remove(T data);
}

2.1. (optional) What does T extends Comparable< super T>> mean?
Ans: It means that T has to be of type Comparable, which can avoid redundantly specifying type parameters”

View Answers (1)

“How comfortable are you working with large data?”

Answer Question