Solving LeetCode 113 in JavaScript (Path Sum II)

Подписаться 4,2 тыс.

Просмотров 1,1 тыс.

50% 1

In this video I solve LeetCode problem 113 (Path Sum II) with the JavaScript programming language. This question has previously appeared during Amazon coding interviews.
▶ Get my FREE Data Structures Crash Course: bit.ly/2YWCn1C
I start by helping you understand what the problem is asking for, then I will go over the pseudo-code/logic for a solution, and finally I will write the solution code explaining each line, step-by-step.
Using my simple and easy-to-understand methodology, I make difficult and complex interview questions incredibly easy to understand. So easy in fact, that even your grandma could do it! 👵🏻
I will be solving a new problem EVERY WEEK, so be sure to smash that subscribe button and hit the notification bell so you don't miss a single one! 😀
▶ Path Sum II: leetcode.com/p...
-----
I also offer full-length interview preparation courses, programming tutorials, and even 1-1 tutoring!
▶ Get access to MY COMPLETE SYSTEM: kaeducation.com
Who knew acing your next software engineering interview could be so incredibly easy!
-----
#programming #codinginterview #leetcode

Опубликовано:

20 окт 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 8

@Brandonstiles 4 года назад

This was great! Good explanation too, man!

@ujjwaljain9780 2 года назад

can you please explain why we are using slice() method??

@asherintech 4 года назад

Great video and explanation! Subbed :) Please make more when you can!

@lejim8298 3 года назад

Time complexity you dont take into account the copying when slices?

@iliamilshtein8611 3 года назад

you have as input an array that you pass to your helper function, so where in array do you have methods like val, left and right?

@alishahrose2076 2 года назад

The input root looks like an array in the example for simplicity. In reality it is a of type TreeNode, which according to Leetcode itself, has three properties i.e., val, left, right. This information is provided in the code editor of the problem which has been cleared in this video. It looks like this: /** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left) * this.right = (right===undefined ? null : right) * } */ /** * @param {TreeNode} root * @param {number} targetSum * @return {number[][]} */