Onsite Loop (Feb 2025)

Behavioral:

1. Leadership
2. Conflicts
3. Projects owned
4. Successes and failures

Interviewer was too intimidating, asked too many questions without giving fair chance/time to explain. I had a bad experience, overall.
Rough start!

Coding 1:

Q1. Given a string, find MAX occurence chars and return them as list
In other words, given a string find a list of all chars with max consecutive occurrences

--
Q2. Merge 3 sorted arrays in strictly O(n)

Follow up: n arrays instead of 3?
Leetcode: 23. merge k sorted lists

Coding 2:

Q1. Given 2 arrays for fare for each day,
Departure NY [5 4 7 9 2]
Arrival DC [1 8 6 3 4]
find min fare for the round trip e.g. 6 here.

Follow up: what if arrival can't be on same day. ans: 7

--
Q2. Given a list of availability array for a team, find max consecutive days team is available, by flipping at max maxFlip values from U to A.
e.g. availability = ['A', 'U', 'U', 'A', 'A', U', 'A'], maxFlip = 2, return 5

SD1:

Design distributed web crawler to download a large site like wikipedia.
Make sure to,

1. download all pages from site.
2. minimize total traffic from the site.
3. minimize amount of traffic coming from any particular node (reduce internode communication in some way is what I understood).
4. download each page once.

SD2:
Design a service to update and search statuses on large scale e.g. 1b users with many updates everyday from each.

1. status is not updatable.
2. search (in range of 10s of billions) for all statuses.
3. search needs to be real time.