There were no difficult questions.

Descriptive questions: the difference between arrays and linked lists, how to insert into an array and a linked list, how to remove from an array and linked list. He also asked me questions about quick sort vs. merge sort, Big O, and another algorithms question -- which I could not answer, because I had not taken the course.

Coding exercise: build a Binary Tree (not BST) and implement a getDepth() method that returns the depth of the tree.

Question

There were no difficult questions. 

Descriptive questions: the difference between arrays and linked lists, how to insert into an array and a linked list, how to remove from an array and linked list. He also asked me questions about quick sort vs. merge sort, Big O, and another algorithms question -- which I could not answer, because I had not taken the course.

Coding exercise: build a Binary Tree (not BST) and implement a getDepth() method that returns the depth of the tree.

Sigiloso · Accepted Answer

I did not complete this coding exercise properly, but came close. He was looking for 2 methods, getDepth() that returns the depth, and a recursive method that traverses the nodes in the tree. Though I was on the right track, I didn't fully complete it.

Tripadvisor

Pergunta de entrevista da empresa Tripadvisor

Resposta da entrevista

Empresas seguidas

Buscas de vagas