He's late...
Hey!
Hey! Sorry I'm a little late
The previous meeting went a little longer than expected
But I'm sure this is alright, right?
Yeah, of course
No worr...
(cuts short) Alright, well
Nice to e-meet you
I'm the engineering manager
I'll be your interviewer today
Let me start by giving you a quick overview of the interview
Oh, did you catch that!?
An overview of the interview?
What a rhyme, huh? XD
Oh, yeah... (chuckle)
Nice one
An overview of the interview
It rhymes...
What a weirdo
Thought so
Enough with the rhyme
We'll break it down into three phases
First, we'll start by briefly introducing ourselves
Then, we'll solve a coding problem together
Okay
Lastly, the last five minutes of the interview
is for you to ask any questions about the company
Cool, sounds good
Alright, why don't you go ahead and tell me about yourself?
Sure, I'm PK
I'm a software engineer at FangSoft
I don't have time to waste
I'll make this quick
And yes, I'm super excited about this opportuni...
(interrupts) Nice
Let me quickly introduce myself as well
I'm JK, and oh, boy
It all started after receiving admission from the Harvard 20 years ago
Wow! Nice...
Oh, boy...
Yeah, having nearly a perfect score on SAT
I have to admit
It wasn't easy
Oh my God...
Are you serious...?
You know, Harvard is super competitive
and I was literally surrounded by these geniuses
I can't believe it's already been 20 years since...
A few minutes later...
Then Microsoft
Google
Facebook
And finally here
Oh, man, it's been a journey
It's been a journey
But you know what?
I'm honestly loving it!
Wow!
That's... great
Awesome
Um... Should we move on to the coding problem...?
Oh my, I'm all over the place
Sorry about that
Yeah, let's do it
Phew... finally...
So here's the question
Given an integer array nums where the elements are sorted in ascending order
we want to convert...
By the way, can you see the question?
Yeah, yeah
I... I can
Cool, cool, alright
So we want to convert the sorted array
into a height-balanced binary search tree
and return its root
Here's an example
Please, take a look at it
Finally, let's see...
The array is sorted
and we want to create a height-balanced binary search tree from it
which means I should...
Oh, by the way
Don't be nervous, okay?
Relax
Alright, cool
Thanks...
Ugh... Where was I...?
Oh, right...
A height-balanced binary search tree
I should use left and right pointers to either end of the...
So how are we doing here?
Do you have any questions?
No, no... Sorry...
Umm...
Can you please give me some time to think?
I just need a few more min...
Of course!
Please take your time!
There's no rush :)
Thanks...
Gosh...
This is getting annoying
What's wrong with this guy?
There's only 15 minutes left!?
Geez...
Okay, here's my strategy
I'm going to place left and right pointers on both ends of the array
Then, I'm going to take the midpoint of the two
as the root of the subtree
Finally, I'll recursively repeat the process
to build the left and right children of the root
adjusting the two pointers accordingly
Okay, that sounds like a plan
Let's code it up
Alright, cool
I don’t have much time
Which programming language are we using?
Java
Okay
What is the purpose of the helper method?
Yeah...
I'm going to recursively call this helper method
to build the sub...
(interrupts) What do l and r represent here?
The l and r are used to represent...
(interrupts) What about this?
What's the base case?
What is your reasoning behind the math for calculating the midpoint?
Which one?
Are we going to adjust the left and right pointers?
What??
Where's the return statement?
Sorry?
Are you finished?
No!
Time's up
Stop typing
Wait, I'm not done yet
Can you please give...
(interrupts) As we discussed earlier
the remaining 5 minutes are for you to ask any questions about...
But wait!
We spent the majority of our time talking!
You can use the remaining 5 minutes to ask any questions about the...
But hey!
You even came 5 minutes late!
Do you have any questions?
Do you have any...
CAN YOU SHUT THE F