There was an initial paper exam consisting of five questions which were not particularly hard.

They included:

1. Write a function that gets the number of set bits in a character.
2. Reverse a linked list.
3. Find the least common ancestor in a tree.

These questions are used as a conversation starter for the actual interview. It is important that you get them right but I doubt if they are of any great consequence.

You need to find the middle of a linkedList.