30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 538. Convert BST to Greater Tree

Given a BST, update each node's value to be its original value plus the sum of all greater node values, performing the transformation in-place. The typical solution uses a reverse in-order traversal to maintain a running suffix sum across nodes (up to 10^4 unique node values).

Asked at:

Microsoft

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early October, 2025

Microsoft

Mid-level

Early October, 2025

Microsoft

Mid-level

Same question, was only asked to write the function signature. Dry run the code

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 538. Convert BST to Greater Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact