Fait partie de Microsoft
Employeur impliqué
Question d’entretien chez LinkedIn
Phone interview : Leetcode Medium DS/algos question. Onsite : - Coding : Minimum window substring , Find leaves of binary tree - System Design and Architecture - Mobile coding - Lunch - Hiring manager interview
Réponse à la question d'entretien
Utilisateur anonyme
18 mai 2018
SOLUTION: vector<vector<int>> findLeaves(TreeNode* root) { vector<vector<int>> res; helper(root, res); return res; } int helper(TreeNode *root, vector<vector<int>> &res) { if (!root) return -1; int depth = 1 + max(helper(root->left, res), helper(root->right, res)); if (depth >= res.size()) res.resize(depth + 1); res[depth].push_back(root->val); return depth; }