Two Code :
Q.1 Sort stack in place.
Q.2 Recursively reverse Linked List
Round 1 :

Q.1 : Explain and discussion on both Codes, especially on sorting stack.
Q.2 : Loop in Lined List, why Incrementing fast pointer as thrice may not work :
Q.3 : Find Nearest Minimum number in left side in O(n) :
Q.4 : Puzzle for 4abcd=dcba, solve a,b,c,d values :
Q.5 : Left view of Binary Tree, and how to solve issue when two branches intersect etc.
Q.6 : Difference of code for finding minimum value in
a. sorted rotated array
b. merged array from two sorted arrays.

Q.7 : Present work, issues solved in backend and forntend in details.

Question

Two  Code :
Q.1 Sort stack in place.
Q.2 Recursively reverse Linked List
Round 1 :

Q.1 : Explain and discussion on both Codes, especially on sorting stack.
Q.2 : Loop in Lined List, why Incrementing fast pointer as thrice may not work : 
Q.3 : Find Nearest Minimum number in left side in O(n) : 
Q.4 : Puzzle for 4abcd=dcba, solve a,b,c,d values : 
Q.5 : Left view of Binary Tree, and how to solve issue when two branches intersect etc.
Q.6 : Difference of code for finding minimum value in
a. sorted rotated array
b. merged array from two sorted arrays.

Q.7 : Present work, issues solved in backend and forntend in details.

BlueStone

Pergunta de entrevista da empresa BlueStone

Empresas seguidas

Buscas de vagas