Timeline

[errant path]

When did you get the invite

[acoustic echo]

Applied - 11/14
OA - 12/14
Invitation - 4/7
Final - 4/17

i also got an email 2/25 asking for photo id verification cause my photo wasn’t clear in the OA

[errant path]

You got survey and invite on same day?

Their timelines are so random for different people

[sly sedge]

@acoustic echo what was asked can you elaborate

[acoustic echo]

Wdym?

ope nvm

Ok, I got the invite and then the survey like 5 minutes later both on April 4th, my interview time was confirmed on April 7th

[acoustic echo]

1st round - all LP questions
2nd round - half LP, design question parking garage
3rd round - LRU cache, given a list of numbers, return a number not in the list

[sly sedge]

Awesome thanks for the info @acoustic echo

How did you prepare for lld

[urban arch]

What requirements were they looking for in the parking design q?

Was the last LC q this - https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array

[hallow drift]

Exact same lol

[hallow drift]

^^

[acoustic echo]

I’ll be honest i didnt lol

[acoustic echo]

Kind of, it was more just find a single number

The numbers were limited to 32 bits, interviewer was more interested in the minimum amount of space you could solve the problem in

[urban arch]

were the numbers in the range 1 to n ?

[acoustic echo]

the prompt of the question was you have a file, each line in the file is one number, read through all the numbers in the file and return a number not in the file

The numbers are from 1 to 2^31

[urban arch]

oh so every number in that range except 1 number

What sol did you propose/he was looking for?

[acoustic echo]

Not necessarily, there could be more than 1 number missing

[acoustic echo]

He wanted me to use bits to represent the numbers that were seen

[urban arch]

oh so store presence in bitset then iterate to find first one that wasnt there

Btw, what were the requirements for the parking garage q?

[urban arch]

and did he expect you to code this up lol - bit manipulation id def trip up on

[acoustic echo]

yes, except i ran out of time

[acoustic echo]

An array corresponding to car sizes, so like [1,2,3] means 1 small spot, 2 medium spots, 3 large spots and then queries (arrival, medium) returns key for the car like 1, (departure, 1), means car 1 is leaving

Like a valet service

[urban arch]

So the queries were (arrival_time, car_size) and (departure_time, car_size)?

or was it just boolean arrival/departure

so essentially you had to free up slot upon departure and allocate upon arrival. If full you'd just store these in a queue?

[acoustic echo]

There was no time, just whether it was arrival or departure, if it was an arrival and there was space you would give them a key, else you would reject saying the parking lot was full or something. Departure would take that key and free up the space the car was taking assuming there was a car associated with that key

[urban arch]

Did you need to store the location /floorof the spot too? else it seems quite simple - just increment or decrement spots and prolly store a set of cars

[acoustic echo]

oop sorry didnt see this, not really. yea I used a dictionary to keep track if a key corresponded to a car in the garage as well as its size