#!process completed amazon final
humble lynx
how do you feel
tropic condor
when did u get OA/VO
ember spoke
what lc q did u get
round yarrow
Finished OA - dec 2nd
Interview invite - jan 2nd
Interview scheduled - jan 17th
Interview rescheduled to today.
he asked me LCA in binary tree
Gave him O(n) approach, he wanted me to optimise it further
round yarrow
there is no way to optimise further than O(n)
lost thistle
how were the LPs?
round yarrow
the only way is when the tree has parent pointers
He mentioned this near the end of the interview
I gave him a solution , he said it would work
but there was no time to code
lps went good
humble lynx
sounds like you got it
humble lynx
lps went good
what were lp's like
ember spoke
lps went good
what lps u get?
round yarrow
But he asked me some tech follow ups on lps
one of those was not completely good i felt
Rest all were good
humble lynx
like about tech stack
ember spoke
whats the work under pressure question
humble lynx
got it
tropic condor
how do you properly answer tight deadline
round yarrow
tell me about a time when u couldnt consider all options before making a decision
humble lynx
damm that's specific
that's insane
he spoke rather than
writing it
i mean pasting
round yarrow
I asked him this in the begininng🥲 , should i code out the node structure
He said no its understood
So i just thought its a regular tree with left and right pointers
he made me write the whole code dry run explain everything
Finally he says , optimise further than O(n) what if we can modify the Data Structure
humble lynx
bro what
elfin rose
humble lynx
you should have flipped the question and asked him
like can you explain me
this discission sounds so one direction
round yarrow
i know but at that point like we were 50 minutes into the interview
I felt like when he wanted me to code , i asked him all the clarifying questions and he was okay with the approach
humble lynx
also like can you tell what he asked tech question in the lps
round yarrow
Regular dfs works just as good
both are O(n)
he was talking about O(logn) case when parent pointers are already provided
not when u need to generate them
round yarrow
he was talking about O(logn) case when parent pointers are already provided
I explained this at the end and he said ya it works , this was just a follow up so dont worry too much about this
Hope so
south vale
it felt like he just read some article on this
lca and lca w parent pointers are 2 lc questions
sounds like he's super inexperienced as an interviewer
should've at least mentioned parent pointer
supple silo
Finally he says , optimise further than O(n) what if we can modify the Data Stru...
If he said what if we can modify structure
Then he gave you a hint