Two telephone interviews:
Count the number of duplicate elements in a Binary Search Tree. They are looking for a specific answer: it has to be an inorder traversal with the previous node matching.
The second interview was inserting into a BST using the function prototype insert(int n);.
The program should work for:
cpp BST root = new BST(); root.insert(10);
You can create the class any way you want, but there are restrictions, such as you have to use primitives (int) as the value.
The following metrics were computed from 2 interview experiences for the Tripadvisor Engineering role in United States.
Tripadvisor's interview process for their Engineering roles in the United States is extremely selective, failing the vast majority of engineers.
Candidates reported having very negative feelings for Tripadvisor's Engineering interview process in United States.