2nd Round:
A design question (don't remember) and another question on adversarial mini-max search

3rd Round:
Write a method to find the next ancestor of a node in a Binary Search Tree.
Write a recursive function to convert Binary Code of a number into its equivalent Gray's code and the other way round.

4th round:
Given two sorted arrays, find the kth minimum element of both.
Given a set of intervals, find the interval which has the maximum number of intersections.

5th round:
This one was focused on previous projects and experience and how good I was at what I had been doing.

Question

2nd Round:
A design question (don't remember) and another question on adversarial mini-max search

3rd Round:
Write a method to find the next ancestor of a node in a Binary Search Tree. 
Write a recursive function to convert Binary Code of a number into its equivalent Gray's code and the other way round.

4th round:
Given two sorted arrays, find the kth minimum element of both.
Given a set of intervals, find the interval which has the maximum number of intersections.

5th round:
This one was focused on previous projects and experience and how  good I was at what I had been doing.

Google

Pergunta de entrevista da empresa Google

Empresas seguidas

Buscas de vagas