Location: Warsaw, Poland
Position: L3 New Grad
Status: In the host matching
Date: started the process on Jan/2020

The process was extremely great, I got referred from a friend working there and started the process on January. I had a discussion with the recruiter about my previous experience and scheduled the phone call immedietly after that.

Phone Call: - 45 mins
Given an array and target value, return the maximum subarray in which the difference between any 2 elements in this subarray doesn't exceed the target value. I was able to discuss different approaches, went through the best solution but there wasn't enough time to complete the code. So, I asked him to write my logic and complexity analysis and he was so open with that.

Onsite Interviews:
couble days later they reached me for the onsite interviews, they were 5 interviews (4 techincal and 1 behavioural interview) all of them were 45 mins beside the behavioural which was 30 mins. I had about 2 months preparation for the interviews, I started working hard on LC problems every day, and I really apperciate this great community leading us to get better in problem solving and complexity analysis.

Round 1:

• Given 2D grid consists of 1's (means free cells) and 0's (means blocked cells). You start at top left corner and you want to reach bottom right corner with the shortest path.
• The following up question was, imagine you have a magic tool which you can use it once to open any blocked cell and you can't use it anymore, return the shortest path as well.
  https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/
  Also, he asked me about the difference between DFS and BFS, which better in what situation and why. I did well in this one and I wrote the code with the complexity analysis.

Round 2:

• Given array of distances between cities (1st element is the distance between 1st and 2nd cities, 2nd element is the distance between 2nd and 3rd cities .. etc) and Tank capacity. You have a petrol station at each city, whenever you drive distance x, your tank will be decreased by x amount of benzene. Return the minimum visits for the stations. The question was pretty straightforward and I did well in this one.

Round 3:

• This one was the worst one I had, the communication between me and the interviewer wasn't that good and the problem had much clarrifications to ask about. Given string S for example "h llo from he oth r sid "
  and given also a dictionary of all english words. Try to match S with all possible right sentences, by swapping any space with any english letter or leave the space as it is. (right sentence means all its words are real english words)
  Possible solutions for the above one:
  "hello from the other side"
"hello from he other side"
  I gave him almost a right approach using Trie and DFS with discussing complexities but couldn't write much code.

Round 4:
It was the best interview, as I finished before the time by 15 mins and we switched it to an open ended discussion about the office and the work environment.

Caluclate the price of parking for different type of vehicles in a garage.
Givens:

map<string, int> vehicle_type_to_free_spots
map<string, string> plate_to_type
map<string, int> price_per_min_for_type
bool OnEnter(string type, string plate): //book a free spot for this plate, or return false if there's no spots
int OnExit(string type, string plate): //charge this plate

I discussed with him how can we calculate that by create another map<string, date> plate_to_date which save that date whenever the plate is entered, and get the difference between current date and saved entered date whenever we exit, then get duration in mins and multiply it by price_per_min_for_type<type>.

Round 5:

• behavioural Q/A about googleyness and leadership.

After 3 days my recruiter proceeded with me for the host matching and currently am waiting for a team to contact me. Wish me the best please :)

Thanks for this great community building a wonderful platform like this to connect people through, and get them better job opportunities by enhancing their problem solving apilities <3

Best of luck ^_^