I introduced myself.
He jumped to coding question :
First question : Given a sorted array which has been rotated k times , need to find k?
Second Question : Given a binary tree find the maximum sum from leaf to leaf?
THird Question : Same as Second now i need to optimize it to work from any node to node?

Question

I introduced myself.
He jumped to coding question : 
First question : Given a sorted array which has been rotated k times , need to find k?
Second Question : Given a binary tree find the maximum sum from  leaf to leaf?
THird Question :  Same as Second now i need to optimize it to work from any node to node?

Sigiloso · Accepted Answer

First was easy was a binary searc.
Second and third were easy as i have done related questions in LeetCode.

Sigiloso · Answer

What team were you interviewing for?

Goldman Sachs

Pergunta de entrevista da empresa Goldman Sachs

Respostas da entrevista

Empresas seguidas

Buscas de vagas