1. given a binary tree, return the number of nodes that got value higher or equal to every node in the path from root to that node.
2. given array of integers, return the first and second lowest numbers.
you got 2:20 hours to solve it.

Question

1. given a binary tree, return the number of nodes that got value higher or equal to every node in the path from root to that node.
2. given array of integers, return the first and second lowest numbers.
you got 2:20 hours to solve it.

Sigiloso · Accepted Answer

I finished in an hour. didn't proceed to next stage.

candidate · Answer

can you please explain the first question?

Vonage

Pergunta de entrevista da empresa Vonage

Respostas da entrevista

Empresas seguidas

Buscas de vagas