Expedia SDE-1 Seattle new grad — phone + 4 onsite rounds
Status: New grad, MS CS Top 20 CS school
Position: SDE1 at Expedia
Location: Seattle, Washington
Date: May 15, 2019
Telephonic interview (1 hour):
- https://leetcode.com/problems/implement-strstr/ -> Haystack needle problem
- https://leetcode.com/problems/merge-sorted-array/ -> Merge 2 sorted arrays
Onsite Interview (4 rounds,1 hour each):
1st round:
- https://leetcode.com/problems/merge-two-sorted-lists/ ->Merge 2 sorted lists
- https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/ -> Remove duplicates from a sorted linked list
- https://leetcode.com/problems/word-break/ -> Word break
2nd round:
This was a discussion round. Manager asked me to implement a feature that would take input from vendors about the services they offer in their hotel and that information has to be updated in the Expedia database.
Example:
If a vendor provides "free wifi" it has to be verified to check if the words are correct. Instead if the vendor provides "tree wifi", there is a charcter difference between 'tree' and 'free' and so we have to update it as "free wifi" in database. If the character difference is more than 1 then we need to throw anexception to vendor indicating wrong word.
3rd round:
- https://leetcode.com/problems/median-of-two-sorted-arrays/ -> Median of 2 sorted arrays. Asked me both o(n) and o(logn) solution.
4th round:
- https://leetcode.com/problems/combination-sum-ii/ -> Combination sum
- https://leetcode.com/problems/two-sum/ ->2 sum
The loop · 5 rounds
Phone: implement strStr; merge sorted array
Onsite R1: merge two sorted lists; remove duplicates from sorted list II; word break
Vendor service string-verification feature (edit distance <=1)
Median of two sorted arrays (O(n) and O(log n))
Combination sum II; two sum