Expedia Interview Experience for SDE-2

Round 1(Problem Solving 1hour):

1. Convert Given Roman numeral to integer

   I -> 1
   V -> 5
   X ->10
   L -> 50
   C ->100
   D-> 500
   M-> 1000

   Example:

   MCMIV -> 1904,  XXVII -> 27

2. Given an array containing only 0,1 and 2, sort the array.

   Input: 1 1 1 0 2 2 1 0
   Output: 0 0 1 1 1 1 2 2

3. Print left view of a binary tree

Round 2(Problem Solving 1hour):

1. Longest Consecutive Subsequence

2. Return the pair having the minimum difference from two unsorted arrays where the pair should consist of one element from each array.

   This question is similar to Smallest Difference pair of values between two unsorted Arrays, the only difference is to return the pair instead of the minimum difference.

Round 3(Design 1hour): Detailed discussion on my past work around the system design choices made

Round 4(Hiring Manager 1hoour): Discussion around past work and behavioural questions. The interviewer was keen on understanding how up to date are you with the latest technologies beyond your work.