Get Premium

Leetcode 112. Path Sum

Determine whether a binary tree contains a root-to-leaf path whose node values add up to a given targetSum. (A leaf is a node with no children.)

Asked at:
Oracle
Amazon
Amazon
Meta

Question Timeline

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

0

Mid March, 2026

Oracle
Senior

Early May, 2025

Meta
Senior

Late March, 2025

Meta
Senior

Get Premium to View All 5 Reports

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

Questions
Meta SWE Interview QuestionsAmazon SWE Interview QuestionsGoogle SWE Interview QuestionsOpenAI SWE Interview QuestionsAnthropic SWE Interview QuestionsEngineering Manager (EM) Interview Questions
Learn
Learn System DesignLearn DSALearn BehavioralLearn ML System DesignLearn Low Level DesignGuided Practice
Links
FAQPricingGift PremiumHello Interview Premium
Legal
Terms and ConditionsPrivacy PolicySecurity
Contact
About UsProduct Support

7511 Greenwood Ave North Unit #4238 Seattle WA 98103

© 2026 Optick Labs Inc. All rights reserved.

Leetcode 112. Path Sum | Hello Interview