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 1443. Minimum Time to Collect All Apples in a Tree

Given a tree rooted at 0 with some nodes containing apples, find the minimum seconds (1 per edge traversal) to start at 0, collect all apples, and return to 0 — equivalently sum 2× each edge that lies on any path to an apple, which can be found by a post-order DFS that prunes subtrees without apples. (n up to 1e5.)

Asked at:

Meta

Question Timeline

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

Company

Level

Region

Late September, 2025

Meta

Mid-level

Late July, 2025

Meta

Senior

Early April, 2025

Meta

Mid-level

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 1443. Minimum Time to Collect All Apples in a Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact