Phone screening with recruiter:

• 3 adjectives coworkers would use to describe you?

• Why would you want to work at Yelp?

• What is the port number used by HTTP?

• What is the protocol underneath HTTP?

• What is the runtime efficiency of searching an element in an array using a binary search algorithm?

• What is the complexity of adding an element to the head of a linked list?

• What is the maximum value of a 32-bit unsigned integer?

• How many digits are needed to code an octet?

  • What if we are in base 8?

• How many bytes are needed to code 64 bits?

• What does SSL stand for and what does it do?

• What is the Linux kill signal?

• What command can be used to highlight the occurrence of a method in a file?

• Would you apply a binary search on a linked list or a sorted array?

• Is an inner join an intersection, a union, or something else?

Phone interview with engineer:

• The interview started with a presentation of himself, his team, and other teams.
• Why computer science?
• Talk about an interesting project you implemented.
• How would you improve it?
• What did you find most interesting in that project?
• If a request takes too long, what could be the reason?
  • Describe the different steps when a form is posted.

Coding problem to do on a shared pad:

Given a list of words, write a function which

takes in the list, and groups the words together

according to which ones are anagrams of each other.

e.g.

input = ["art", "rat", "bats", "banana", "stab", "tar"]

output = [["art", "rat", "tar"], ["bats", "stab"], ["banana"]]

I wasted too much time trying to come up with an iterative solution when the problem is "easily" solvable with a recursive algorithm.