A technical interview conducted in English, focusing on algorithm and data structure questions, takes place through the LifeCode platform.

During the process, the candidate needs to solve programming challenges, explain their solutions, and demonstrate problem-solving skills in real-time.

The evaluation considers the ability to write efficient code, justify choices, and optimize algorithms.

The questions may cover:

• Arrays
• Linked lists
• Trees
• Sorting
• Searching
• Complexity analysis

This requires clear communication and logical reasoning throughout the session.

You have n boxes labeled from 0 to n - 1. You are given four arrays:

• status: status[i] is 1 if the ith box is open and 0 if the ith box is closed.
• candies: candies[i] is the number of candies in the ith box.
• keys: keys[i] is a list of the labels of the boxes you can open after opening the ith box.
• containedBoxes: containedBoxes[i] is a list of the boxes you found inside the ith box.

You are given an integer array initialBoxes that contains the labels of the boxes you initially have. You can take all the candies in any open box, use the keys in it to open new boxes, and also use the boxes you find inside it.

Return the maximum number of candies you can get following these rules.