Jason Jets
Region: US
Thursday 05 August 2021 22:48:34 GMT
190515
12432
441
826
Music
Download
Comments
Planet Positivity Central :
Well, I make over $100M so I just pay software engineers a few hundred grand a year to solve equations & riddles. 😳
2021-08-06 01:56:51
156
Kelvin :
how is this relevant to anything? practical questions are much more useful 🙄
2021-08-06 04:12:51
150
jdubdev :
Interview: 🧮📉✖️➿♾ Actual job: tinkering with config files, and debugging why divs aren’t centered on Internet Explorer.
2021-08-11 17:53:29
617
ronny8D :
I’m a math guy and I recognize this is a graph theory problem right away
2021-08-05 23:56:53
66
Uday Rajaram :
C the answer is C
2021-08-11 23:18:07
137
user9604147063185 :
I didn’t even understand the question.
2021-08-11 16:12:50
10
KennyHan :
Hmmmm. That is a pretty interesting question. *checks stack overflow*
2021-08-24 23:49:09
169
JoseL :
Lol I ve taken 2 computer science courses in highschool and think this is right: count every roght turn as +1 and left turn as -1. Then simply...
2021-08-12 00:45:19
18
Aaa :
Dude, just traverse and save into a HashMap. Also, keep track of the column. Left side negative column counter and right side positive column…
2021-08-11 22:17:09
15
The Boop :
the root is zero. a left is -1, a right is +1. print all values of same end value
2021-08-07 00:55:36
21
Kitty Canon :
Easy. Use Python and print(tree). Then tell them that the problem is irrationally difficult.
2021-08-26 19:43:11
8
Flour Tortilla :
Oh snap! You from Dallas? Luka for life
2021-08-06 03:04:48
12
historybuffjb :
This is a simple BFS question where you keep track of your level, but instead of depth you look at width.
2021-08-06 23:00:17
9
Matt2Harrington :
Sadly I just don’t think I’ll ever be able to make it in FAANG. I’m two years into the field and I just feel like the interview process is too much:/
2021-08-06 00:58:41
45
Thiccboichef :
so from your root node you traverse the tree to find your max left, max right, and max depth. once you have that then you know where your root node
2021-08-25 05:56:52
10
☠️ :
Bro it’s super easy. So basically get the values of all the tree and just hardcode the values in the way they want to see.
2021-08-12 02:42:21
10
Rollone Ltd :
Easy, restart your computer. 😅
2021-09-16 12:22:44
29
Jt :
the answer is to learn databases and earn about the same and think much less. man idk.
2021-08-12 03:02:29
8
Ned :
I could do it but the solution would not be elegant or efficient. is there a solution somewhere?
2021-08-05 23:53:20
5
dylancvest :
Me hoping it's a True/False question😳
2021-09-03 23:54:08
4
M_o_n_t_a_n_a :
I'm not sure if it's difficult or you are explaining it wrong.
2021-09-22 12:39:24
4
Matthew M Young :
Next level
2021-08-12 21:19:54
4
ThisWorksForUs :
You can’t be serious? That’s such basic problem. Maybe I missed something?
2021-08-26 03:07:49
3
Adrien :
Breadth first search algorithm
2021-08-07 03:03:25
3
To see more videos from user @jasonjets, please go to the Tikwm
homepage.
