Five Leetcode questions:

Round-1:

1. Find the depth of a binary tree.
2. Implement a stack with push, pop, top and getMin() functions in constant time.
3. Check if two strings are anagrams or not.

Very optimal solutions required instead of brute-force.

Round-2:

1. Partition Lables
2. Maximum value between two nodes in a binary search tree.

Question

Five Leetcode questions:

Round-1:

1. Find the depth of a binary tree.
2. Implement a stack with push, pop, top and getMin() functions in constant time.
3. Check if two strings are anagrams or not.

Very optimal solutions required instead of brute-force.

Round-2:

1. Partition Lables
2. Maximum value between two nodes in a binary search tree.

Sigiloso · Accepted Answer

I gave optimal solutions to 4 of them. The struggled with the last question where I could only come up with a brute-force solutions. Also, I realized they were all leetcode only after the interview when I looked up.

Amazon

Pergunta de entrevista da empresa Amazon

Resposta da entrevista

Empresas seguidas

Buscas de vagas