Cafyo Management Solution Interview Questions and Answers

The task is to find the actual order of people in a queue based on their heights and the number of taller people in front of them.

• Iterate through the given arrays and create a list of tuples containing the height and number of taller people for each person.

• Sort the list of tuples in descending order of height and ascending order of the number of taller people.

• Create an empty result list and insert each tuple into the result list at the index specified by the number of taller ...read more

The task is to find if a given value is present in a Binary Search Tree (BST).

• Start from the root node and compare the value with the target value.

• If the value matches, return true.

• If the target value is less than the current node value, move to the left child.

• If the target value is greater than the current node value, move to the right child.

• Repeat the process until a match is found or a leaf node is reached.

• If a leaf node is reached and no match is found, return false.