#Timeline?

1 messages ยท Page 1 of 1 (latest)

unborn nova
#

Title

velvet hamlet
#

Oct 3 - Applied
Oct 12 - Recruiter asks to schedule Onsites
Oct 19 - Recruiter prep call - talks about what to expect
Oct 20/21 - Onsites 1 Behavioural + 4 techs
Nov 5 - HC passed
Nov 12 - PA + location match -> platforms and ecosystem in MTV

unborn nova
#

you had an offer deadline?

sudden sentinel
#

how many questions did each technical have

marble mauve
#

no OA?

glacial temple
#

how was your final?

velvet hamlet
# marble mauve no OA?

nah - not sure why but got skipped to final - maybe cause they had OA on the file from last year or cause I went through the Canadian application - not sure

#

they were a bit weird but overall pretty good
behavioural
- I don't think I messed up - I just wasn't vibing the way I usually do - he warmed a bit towards the end though

Tech 1
- simulation type question - this was really easy - The only thing I was worried about was if my interviewer wanted me to make something more extensible - she seemed happy though

Tech 2 - common DP problem
- told him it looks familiar and gave an outline of my solution
- he told me to implement and the dude seemed slightly disappointed when I got optimal working
- he was like I wanted to work toward the optimal
- I got time complexity wrong here initially nlgn instead of nlgk
- then he asked me to create a klgk - solution and I showed him why that's impossible he was like oh I mean nlgk - and I was yea my solution is nlgk
- at the end, he was like can u manually implement binary search instead of calling the built-in function

Tech 3 - binary tree type problem
- I got optimal time but not auxiliary space
- she wanted to see if I could come up with the other optimal towards the end
- I was brainstorming solutions and I said we could probably do X to solve it that way but that's probably overcomplicating it - and she was like why is that overcomplicating it ๐Ÿ’€
- we had like 5 mins at that point so I didn't get to coding up the other optimal but she said it was all good

Tech 4
- Solved initial questions optimally
- got asked to implement binary search manually
- For follow up - I had like 8 mins left lmaoo - got asked how I would handle repeated queries
- I was like tries - he was like we don't have time to code up the solution for follow up fully but can u code up the modified trie
- Coded correctly - all my time analysis were accurate as well

#

Also just so no one else gets a heart attack - my recruiter just called out of the blue - like she never scheduled a call - so like every time she would call I expected a rejection lmaoooo

indigo folio
#

Imao my recruiter did the same, I almost died KEKW

nova thicket
#

Congrats abdullah, they put u thru the ringer and u made it. U earned this, fb L was training for this

limpid linden
#

Good shit dude ๐Ÿ๐Ÿ™๐Ÿฝ

old geode
#

LETS GOOOOOOOOOOOOOO

velvet hamlet
sudden sentinel
#

Can you explain what was prep like ? I have fb interview coming up and I am anxious af

steep bronze
#

Interested in what the prep was like too

rain gust
velvet hamlet
#

bits turned out to be useless

rain gust
#

For google should I just focus on dp, graph, tress?

velvet hamlet
#

reviewing trees, and linked-list and heaps questions were the most useful data structures for me

rain gust
#

I also just got skipped to finals lol

#

I did blind 75 and this list by Sean

velvet hamlet
#

I think graph are usually pretty straightforward - but definitely good to review

rain gust
#

I see, thank you

unreal forum
#

ohh congrats

#

i've also done a lot of lc tagged for fb but it seems like google q's are like a lot harder

fickle lichen
#

i think goog qs are harder but they give u more time