Search
⌘K
Leetcode 3203. Find Minimum Diameter After Merging Two Trees
Given two trees, choose one vertex from each and add an edge so the resulting tree's diameter is as small as possible. Key insight: compute each tree's diameter and center/radius — the optimal connection is between centers and the minimum possible diameter is max(d1, d2, ceil(d1/2)+1+ceil(d2/2)).
Asked at:
Microsoft
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid December, 2025
Microsoft
Senior
The wording of the problem was different but essentially the core was this problem: https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees/description/
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.