Envié una solicitud electrónica. El proceso duró 4 semanas. Acudí a una entrevista en Google (Tel Aviv)
Entrevista
1. Recruiter minimal screening (First phone call) - Only basic question about time complexity of simple algorithms (Like sorting etc).
2. Technical screening (Second phone call) - Recursive\Dynamic Programming question that can be also solved using a HashTable
3. On-Site interview day (5 * 45 min interviews) - Questions included:
3.1. Designing a desktop application
3.2. Designing objects, data structures and relationships for an Office application.
3.3. Chess question.
Preguntas de entrevista [1]
Pregunta 1
Solve a Kakuro item - Given S - the sum, N - number of slots and P - you can use numbers between 1 - P.
You should only use a number once and same numbers are considered as the same solution.
Example: S=6, N=2, P=6
Answers:
1. 4,2
2. 5,1
3. 3,3
