3 Round
1) HR round - simple
2) With the Director - Talk about you and your experience
3) Panel interview with technical team - Live coding and 15-minute Technical question answer,
Coding question -
a)Binary Search Tree - Find a K from the tree
b) input: nums[], r = 0, w = 1, b = 2
output: sorted nums[] (in-place)
nums = [0,2,1,2,1,0]
return [0,0,1,1,2,2]
withut new array