Skip to content

Loading the question…

Explore

Questions Companies Concepts Guides Sign in

How it works Questions Companies Concepts Guides Pricing Sample scorecard

Path Sum: coding question | SysRound

Questions / Coding

CodingDifficulty not specifiedLeetCode 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…

Open practice workspace

Available question text

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.)

Related questions

Continue with questions that share topics or the same question type.

Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
Kth Smallest Path XOR Sum
Coding
Maximum Path Sum with Conditional Node Processing
Coding
Maximum Sum Leaf to Root Path in Binary Tree
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 3 records

Amazon
Leetcode 112. Path Sum
Reported Nov 8, 2024 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source
Meta
Leetcode 112. Path Sum
Reported May 3, 2025 · 3 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source
Oracle
Leetcode 112. Path Sum
Reported Mar 13, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

Make space for your answer

Use code, block notes, and a whiteboard in one workspace.

Start practicing

Company associations

Amazon
Meta
Oracle

More coding questions

Practice system design interviews out loud with an AI interviewer, a shared whiteboard and a scorecard for your level.

Questions by company

Sample scorecard

Use it as an app

About and how we write

Terms and guidelines

© 2026 SysRound. SysRound is an AI practice tool. The AI interviewer and the AI feedback can be wrong. Use it for your own practice, not to hire people.