Envié una solicitud electrónica. El proceso duró 1 semana. Acudí a una entrevista en Clustrix (San Francisco, CA)
Entrevista
Recruiter contacted me after I applied online and quickly scheduled a phone interview and said I will be asked simple programming questions. On the phone, interviewer called and general resume talks. I was asked following question:
1. Find greatest element in a binary search tree
2. Find second greatest element in a BST without sorting and without in-order traversal
Stumbled on the second question. They are looking for extremely talented candidates with fast pace pickups on trees and C.
Preguntas de entrevista [1]
Pregunta 1
Traverse left sub-tree of the highest element to find the second largest element.
