Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Day 135 #280

Closed
vaskoz opened this issue Jan 4, 2019 · 0 comments
Closed

Day 135 #280

vaskoz opened this issue Jan 4, 2019 · 0 comments
Assignees
@vaskoz

Comments

@vaskoz
Copy link
Owner

vaskoz commented Jan 4, 2019

Good morning! Here's your coding interview problem for today.

This question was asked by Apple.

Given a binary tree, find a minimum path sum from root to a leaf.

For example, the minimum path in this tree is [10, 5, 1, -1], which has sum 15.

  10
 /  \
5    5
 \     \
   2    1
       /
     -1
@vaskoz vaskoz self-assigned this Jan 4, 2019
@vaskoz vaskoz mentioned this issue Jan 4, 2019
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@vaskoz vaskoz

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@vaskoz