Tree & Graph Technical Interview Problem@ LinkedIn, Google, Microsoft,Amazon | Valid Graph Tree: 261

#LeetCode #Premium #Graph #Technical #Interview #DFS #Leetcode #Medium #Meta #Facebook #Bloomberg #Amazon #Google

This is an Amazing LeetCode Premium Problem, that everyone must learn to solve.

What is better than Graph and Tree interview Problems? Graph + Tree problem.

Learn to solve this beautiful Leetcode medium graph problem that has been asked in many technical interviews at companies like Google, Facebook, Meta, Bloomberg, Amazon, Microsoft

Problem: Graph Valid Tree: Leetcode 261

This is a great problem to solve and get mastery over Graph Theory and DFS, BFS, HashMap concepts.

Not stopping till we get employed in FAANG.

This Problem was recently asked in following companies in Technical Coding Interview:
LinkedIn interview,
Google interview,
Microsoft interview,
Amazon interview,
Bloomberg interview,
Coupang interview,
Qualtrics interview,
TuSimple interview,
Facebook interview,
Zenefits interview,

-------------------------------------------------------------------------------------------------------------------------
(Contact me if you want to sponsor your product):

List of Most Important Questions and Solutions:

GitHub Repository for Questions solved so far:

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

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 worked on operations (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 enought. 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 atleast one video a day. Hence, I started this channel.

Here are 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,
Facebook,
Google,
Amazon,
Netflix,
Microsoft,
apple,
doordash,
roblox,
stripe,
instacart,
uber,
lyft,
twitter,
linked In,
pinetrest,
bloomberg,
robinhood,
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: 00:28
A Small Announcement: 03:45
Simple Solution: 04:03
Most Optimal Solution: 25:46
Coding: 31:08

[DestinationFAANG]

Java Solution

class Solution {
public boolean validTree(int n, int[][] edges) {

if (edges.length != n-1){
return false;
}

List<List<Integer>> adjancencyList = new ArrayList();
for(int i=0; i<n; i++){
adjancencyList.add(new ArrayList<>());
}

for(int[] edge:edges){


}

Stack<Integer> stack = new Stack<>();
HashSet<Integer> visited = new HashSet<>();


stack.push(0);
visited.add(0);

while(!stack.isEmpty()){
int node=stack.pop();
for(int

continue;
}
visited.add(neighbour);
stack.push(neighbour);
}
}

if(visited.size() == n){
return true;
}
return false;
}
}

[cvramankishoreu]

lol wilsmith slap to explain subset superset