Популярное

Музыка Кино и Анимация Автомобили Животные Спорт Путешествия Игры Юмор

Интересные видео

2025 Сериалы Трейлеры Новости Как сделать Видеоуроки Diy своими руками

Топ запросов

смотреть а4 schoolboy runaway турецкий сериал смотреть мультфильмы эдисон
dTub
Скачать

Binary Tree Maximum Path Sum: 124 - Tree interview Question @ Google, apple, Amazon, meta, microsoft

Автор: Destination FAANG

Загружено: 2022-07-10

Просмотров: 855

Описание:

#tree #binarytree #bst #leetcode #technical #interview #question #problem #googleinterview #amazoninterview #facebookinterview #appleinterview #microsoftinterview #google #facebook #microsoft #amazon #apple #meta #bloomberg #timecomplexity #spacecomplexity #optimalsolution #twitter #baidu

Learn to solve this amazing Leetcode hard, Binary Tree problem that has been asked in hundreds of technical interviews at companies like Google, Facebook, linked in, Microsoft, Meta, apple, Uber.

LeetCode Problem: Binary Tree Maximum Path Sum
Leetcode link: https://leetcode.com/problems/binary-...
Leetcode: 124


Not stopping till we get employed in FAANG.

This Problem was recently asked in following companies in Technical Coding Interview:

Amazon technical interview,
DoorDash technical interview,
Microsoft technical interview,
Facebook technical interview,
Google technical interview,
ByteDance technical interview,
tiktok technical interview,
Oracle technical interview,
Snapchat technical interview,
Adobe technical interview,
Twitter technical interview,
Twilio technical interview,
TuSimple technical interview,
Samsung technical interview,
Bloomberg technical interview,
Sprinklr technical interview,
Shopee technical interview,
Apple technical interview,
Uber technical interview,
Yandex technical interview,
Myntra technical interview,
LinkedIn technical interview,
Yahoo technical interview,
Walmart Global Tech technical interview,
PayTM technical interview,
Wish technical interview,
DiDi technical interview,
Flipkart technical interview,
Baidu technical interview,
Wix technical interview,

-------------------------------------------------------------------------------------------------------------------------
(Contact me for Business Inquiries):
Email: parth.vyas2729@gmail.com

List of Most Important Questions and Solutions:
https://docs.google.com/spreadsheets/...

GitHub Repository for Questions solved so far:
https://github.com/DestinationFAANG/D...

(Support the channel, if videos helps you in any manner... Give me a Coffee)
Patreon:   / destination_faang  

About me and My Purpose:

I am a software engineer with 5+ years of experience @ Non-FAANG company. I have always been bad at coding and really bad at programming interviews. So, once I got employed in IT industry, I only worked on operational activities (just so I can avoid coding).

But deep down I always wanted to work at an Elite IT company. So, I decided to face my fears, and to master coding & technical Interviews. I started with LeetCoding 1 problem a day. But I was facing issues with consistency, I would solve LC problems for week, and then drop it for 2-3 weeks. This lasted till 6 months.

And upon deeper investigation I found that I was not committed enough. Then suddenly my wife gave me an idea, that rather then focusing on solving a LC problem for my-self, why don't I commit to make videos on solving the LC problems. And try to complete at-least one video every alternate day. Hence, I started this channel.

My ultimate aim is to get into FAANG company, and also create a channel in such a way that anyone wants to get into FAANG, if they just follow my channel, they should be able to clear all the FAANG Technical Interviews.

Here are few more reasons on why I started the channel.

1) To have a motive for me to solve leetcode problems.
2) In order to solve a LC problem, first I have to really understand the problem and explain my thought process, which solidifies my concepts.
3) I can document my progress. Also learn a new skill on how to run a YT channel.
4) My work can help other software engineers.
5) I can have something cool to mention in my linked-in and resume.
-----------------------------------------------------------------------------------------------------------------------------------

Here is a list of my dream Companies:

FAANG,
Meta,
Facebook,
Google,
Amazon,
Netflix,
Microsoft,
apple,
doordash,
roblox,
stripe,
instacart,
uber,
lyft,
twitter,
linked In,
pinetrest,
bloomberg,
robinhood,
Goldman Sachs,
box,
two sigma,
byte dance,
tik tok,
air bnb,
nuro,
ui path,
oracle,
twitch,
data bricks,
waymo,
dropbox,
coinbase,
snowflake,
snap,
nvdia,
broadcom,
slack,
intel,
cisco,
indeed,
salesforce,
reddit,
wayfair,
okta,
splunk,
service now,
coursera,
square,
upgrade,
mozilla,
yelp,
unity,
ebay,
affirm,
stach adapt,
amplitude,
github,
wish,
brex,
etsy,
chime,
shopify,
amd,
GoDaddy,
IBM

Introduction: 00:00
Understanding the Problem Statement: 00:23
Optimal Solution : 3:57
Coding: 13:44

Binary Tree Maximum Path Sum: 124 - Tree interview Question @ Google, apple, Amazon, meta, microsoft

Поделиться в:

Доступные форматы для скачивания:

Скачать видео mp4

  • Информация по загрузке:

Скачать аудио mp3

Похожие видео

Binary Tree Level Order Traversal: 102 - Tree technical interview, @ Google, apple, Amazon,microsoft

Binary Tree Level Order Traversal: 102 - Tree technical interview, @ Google, apple, Amazon,microsoft

LeetCode 124. Максимальная сумма пути в двоичном дереве (объяснение алгоритма)

LeetCode 124. Максимальная сумма пути в двоичном дереве (объяснение алгоритма)

Leetcode 75 - Blind 75 playlist

Leetcode 75 - Blind 75 playlist

Понимание B-деревьев: структура данных, лежащая в основе современных баз данных

Понимание B-деревьев: структура данных, лежащая в основе современных баз данных

Focus Music • Zero Distractions for Deep Work, Study & Hyper Focus | Calm Productivity Soundscape

Focus Music • Zero Distractions for Deep Work, Study & Hyper Focus | Calm Productivity Soundscape

Path Sum (LeetCode 112) | Full solution with visuals and graphics | Study Algorithms

Path Sum (LeetCode 112) | Full solution with visuals and graphics | Study Algorithms

4 Hours Chopin for Studying, Concentration & Relaxation

4 Hours Chopin for Studying, Concentration & Relaxation

[Java] Leetcode 124. Binary Tree Maximum Path Sum [Binary Tree #16]

[Java] Leetcode 124. Binary Tree Maximum Path Sum [Binary Tree #16]

Медиана двух отсортированных массивов: интервью с 4 массивами в Google, Apple, Amazon, Meta, Micr...

Медиана двух отсортированных массивов: интервью с 4 массивами в Google, Apple, Amazon, Meta, Micr...

Lowest Common Ancestor of a Binary Search Tree: 235 -Tree interview@ Google, Amazon, meta, microsoft

Lowest Common Ancestor of a Binary Search Tree: 235 -Tree interview@ Google, Amazon, meta, microsoft

it only took 2 characters

it only took 2 characters

Изучите Microsoft Active Directory (ADDS) за 30 минут

Изучите Microsoft Active Directory (ADDS) за 30 минут

Удар по Темрюку, Трамп в Давосе, Адам идет на поправку. Галлямов, Касьянов, Филиппенко

Удар по Темрюку, Трамп в Давосе, Адам идет на поправку. Галлямов, Касьянов, Филиппенко

1-Hour Pink & Orange Aura Study Timer | No Breaks, No Music | Deep Focus ⏳✨

1-Hour Pink & Orange Aura Study Timer | No Breaks, No Music | Deep Focus ⏳✨

lofi hip hop radio 📚 beats to relax/study to

lofi hip hop radio 📚 beats to relax/study to

ACTIVE EL 100% DE SU CEREBRO 💯 Música para estudiar, concentrarse y memorizar

ACTIVE EL 100% DE SU CEREBRO 💯 Música para estudiar, concentrarse y memorizar

Рабочая музыка для глубокой концентрации и сверхэффективности

Рабочая музыка для глубокой концентрации и сверхэффективности

Construct Binary Tree from Preorder and Inorder Traversal - 105 technical interview - Google, amazon

Construct Binary Tree from Preorder and Inorder Traversal - 105 technical interview - Google, amazon

Lowest Common Ancestor in Binary Tree | DSA Series : L.89

Lowest Common Ancestor in Binary Tree | DSA Series : L.89

Focus Music • Zero-Distraction Hyperfocus for Deep Work, Study, and Peak Productivity

Focus Music • Zero-Distraction Hyperfocus for Deep Work, Study, and Peak Productivity

© 2025 dtub. Все права защищены.



  • Контакты
  • О нас
  • Политика конфиденциальности



Контакты для правообладателей: infodtube@gmail.com