Path Sum 2 | Javascript | Leetcode Question 113 | Amazon
NOTE: If you're not into the algorithm side of computer programming, this video is probably not for you.
If you wanna skip the breakdown of the problem, the actual CODING starts ~3:55.
In this video, you'll learn how to do a depth-first search on a binary tree, using recursion.
We'll go through Leetcode problem #113, called 'Path Sum 2'. This question is being asked by Amazon in their coding interviews, & will give you a peek into how you'd go about solving one of these computer science problems.
When I started learning how to do recursion & traversing a tree.... it was confusing.
It took watching tons of videos & literally writing out the problem by hand in order to get a grasp on how to solve this type of problem.
But you can do it!
You'll also learn a 5-step method to solve almost any type of algorithm problem you come across.
------------------
------------------
I’m always looking for cool new tools to try & make videos about. Reach me at [email protected] with any recommendations.
My site: https://brandonstiles.com
Get the ‘First Page Pro’ SEO Training here: http://bit.ly/2Z6HRXS