Screening Round

Q1:
Given departure and return flight ticket price in two seprate array for each day. Give minimum cost round trip

Q2:
Get Max K element in un sorted array

On Site:
Coding 1:
Q1:
find closest element in BST

Q2:
product of two sparse array like more zeros then non zero number
optimal storage of array then
extention of one long and other short array

Coding2:
Q1:
Left view and then right view of tree in response
second question forgot

Design round:

Design Top K songs per user for past 90 days
Messed it up big time by having two pointer approach from hellointerview.

Behavioural round:

1. project proud of
2. conflict handling
3. building systenm with unclear requirement
4. How you are improving yourself continuosly
5. handling conflict in product discussion
6. difficult work environment how did you manage.

I can't imagine i messed it up this process.

#Meta #London #interview