There was a coding round and i got rejected in the coding round itself. There were 3 questions that needed to be done in 90 minutes. All the questions were pretty tough
Questions d'entretien [1]
Question 1
Given a tree calculate the smallest positive number that is not present in that subtree for all the nodes