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

List of Most Important Questions for FAANG Interviews:
https://docs.google.com/spreadsheets/...

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


Learn to solve this amazing Leetcode easy, 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: Lowest Common Ancestor of a Binary Search Tree
Leetcode link: https://leetcode.com/problems/kth-sma...
Leetcode: 235


Not stopping till we get employed in FAANG.

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

LinkedIn technical interview,
Facebook technical interview,
Amazon technical interview,
Apple technical interview,
Microsoft technical interview,
Google technical interview,
Uber technical interview,
Walmart Global Tech technical interview,
Oracle technical interview,
Huawei technical interview,
Reddit technical interview,
Twitter technical interview,

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

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: 02:29
Coding: 08:43