0:25
hi hey tom my name is jerry
0:29
i will be conducting your technical
0:33
um just a little bit about myself i
0:36
am a senior software engineer at the
0:38
application service platform
0:40
infrastructure mobile kubernetes
0:42
engineering team and i have been with
0:47
a good eight years now alright
0:50
this is it the moment of truth i am so
0:55
i have been practicing nico for the past
0:58
day and night i have never felt more
1:03
time and space complexity are
1:06
i can easily clear all the median
1:08
questions without looking at the
1:12
my forearms are so big and sore probably
1:15
because i've been typing so much
1:17
and so fast i'm finally going to see a
1:21
return on my lego premium subscription
1:26
okay so why don't you start with telling
1:28
me a little bit about yourself
1:30
ah oh no i spent all my time on litco
1:34
and completely forget to prepare for the
1:36
stupid behavioral questions
1:38
oh my god what do i do what do i tell
1:41
about myself i had a big breakfast today
1:44
just so i can carve up and now
1:46
no no no that's not what he wants to
1:50
are you still there gotta say something
1:52
clever about my resume
1:54
yes my job oh no i don't really like the
1:57
people in my team and i haven't done
1:59
anything since the pandemic i committed
2:02
comments in code and removed
2:04
some more comments just so people think
2:08
oh wait maybe i can just lie
2:11
and he would never find out just like
2:14
how my manager always told me
2:15
i would get a pay raise easy peasy
2:19
i have been working at this company as a
2:21
back-end software engineer since i
2:24
i really like my job and my team and
2:27
i've been learning a lot from them
2:29
i am passionate about doing impactful
2:31
work and solving complex
2:32
and challenging engineering problems and
2:36
i code really fast okay okay
2:40
sounds good um cool if you're ready
2:43
let's dive right into the coding part
2:45
i just want to let you know that i do
2:48
5-10 minutes at the end for you to ask
2:53
does that sound good to you you're
2:54
kidding me i was born ready
2:58
uh tom oh yes please please go ahead
3:01
cool so here's the question given an
3:05
and the number k i want you to write a
3:08
function that returns the k
3:10
largest element array the k is
3:13
guaranteed to be smaller or equal to the
3:17
so here's an example of input and output
3:20
feel free to think out loud and walk me
3:23
through your thoughts
3:24
jack madam hacking pod i was studying
3:27
the exact same question just a few days
3:30
if i remember correctly it was number
3:32
215 medium in lead code
3:35
i am lee coded and unbeatable
3:38
but hold on i need to pretend i've never
3:40
seen this question before otherwise he
3:42
might be suspicious if i finish it too
3:51
i'm not sure if i oh no worries um i can
3:55
if you don't know where to start hint
3:59
strong higher killer so many newbies
4:01
were down leveled or ghosted after the
4:04
i would not fall for this trap oh no no
4:07
i don't mean hard i mean
4:08
hot it's so hot here i gotta go turn on
4:11
my ac if you don't mind
4:13
yeah go ahead thanks i'll be right back
4:23
most mediocre engineers will think hip
4:27
by maintaining a k size priority queue
4:29
runtime complexity is slightly better
4:31
than sorting the entire array
4:34
naive solution only good enough for
4:37
it is most efficient to use quick select
4:41
but it would take some time to implement
4:43
since i've done so many legal questions
4:45
this is too trivial for me i am a much
4:48
better engineer than you
4:53
okay wow this actually looks pretty good
4:57
can you kind of talk a little bit about
5:00
the runtime complexity here
5:02
yeah the simplest brute force solution
5:05
n which is basically just sorting the
5:07
array but if you use a heap like data
5:10
structure you can actually achieve a
5:11
slightly better performance which is
5:13
n of log k however with my quick sort
5:16
algorithm the wrong time complexity is
5:19
further reduced down off n in average
5:22
case and of course the worst case will
5:29
cool thanks tom this is awesome um i
5:32
think that's it for me
5:33
are there any questions that you want to
