Question d’entretien chez Google

Tree construction and traversal, traveling knapsack-like problem, DP. Leetcode medium-hard.