Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2846. Minimum Edge Weight Equilibrium Queries in a Tree
Given a weighted tree and many independent queries, for each query compute the minimum number of edge weight changes needed to make all edges on the a–b path equal — equivalently, path length minus the frequency of the most common weight on that path. The core challenge is answering "most-frequent-weight-on-path" queries efficiently over the tree.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.