HR Phone screen where I talked to the recruiter about my background, nothing special. Then followed by Phone Technical Interview. Didn't get to pass this one. I regret not asking for more clarification questions about the second problem.

1. You have n doors in a row that are all initially closed. You make n passes by the doors starting with the first door every time. The first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). The second time you only visit every 2nd door (door #2, #4, #6. Third pass you toggle 3rd, 6th, 9th door. What state are the doors in after the last pass? Which doors are open?

/**

• A tournament tree is a binary tree
• where the parent is the minimum of the two children.
• Given a tournament tree find the second minimum value in the tree.
• A node in the tree will always have 2 or 0 children.
• Also all leaves will have distinct and unique values.

• 2             
  

• / \
• 2 3
• / \ | \
• 4 2 5 3
• In this given tree the answer is 3. / class Node { Integer value; Node left, right; Node(Integer value, Node left, Node right) { this.value = value; this.left = left; this.right = right; } } class Solution { /*

  • This should return the second minimum

  • int value in the given tournament tree */ public static Integer secondMin(Node root) {

    } }