J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez Yelp (San Francisco, CA) en févr. 2018
Entretien
First I received a call from a recruiter asking me to finish a hackerRank test. I got it pretty fast. It was a hashmap problem. Then scheduled a skype call with an Yelp Engineer who asked me to solve a Graph topological problem. I wasn't very sure about topological sort and the whole process was just less than 20 mins so I briefly use a method to sort the graph and then do a BFS traversal to construct the tree.
Questions d'entretien [1]
Question 1
Given a list of List<Pair>, which pair mean a boss- reportee relationship. Use an N-child tree to represent a company management structure. CEO sits on top of the tree and each node may have a list of 1 to N reportees. return the tree Node.
