Two 1-on-1 technical interviews, each 45 minutes long.

The first was with a young engineer, who wasn't very friendly. He asked me to solve a problem about the memory usage of a HashMap and another about String manipulation.

The second was with a more friendly senior manager. He asked me to solve a game problem.

There are 9 boxes labeled 1 to 9. Some are open, and some are closed. When you throw two dice, you have to close the boxes that sum up to the number on the dice. For example, if you get 6 and 1 on the two dice, you have to close boxes that add up to 7 (3 and 4, 2 and 5, 1 and 6) if they aren't already closed.

Implement an algorithm that, given the status of the boxes and the value from the dice, returns all possible combinations of boxes that can be closed to sum up to the number on the dice.