Expedia SDE-1 Gurgaon — OA + 2 tech rounds; offer
Status: New grad, BTech. Non-CS
Position: SDE1 at expedia
Location: Gurgaon, India
Date: January 20, 2021
Hackerrank Test (1.5 hours):
3 Algorithmic and DS questions only
- Min move for knight to reach a cell from some initial cell in N * N grid.
- I don't remember other two questions but they were easy-mid questions. In one we had to use sorting and in other a heap.
Was able to do all in 20-25 minutes.
1st technical round (1 hour):
- Given a binary tree, return true if a node's value is the average of all its children.
He was only going to ask only a single question (he said) but since I solved in about 25 mins and there was some time he asked another question.
- Minimum costs to paint houses with RGB colors.
exact question: There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certain color is different. You have to paint all the houses such that no two adjacent houses have the same color. The cost of painting each house with a certain color is represented by a n x 3 cost matrix. Find the minimum cost to paint all houses.
2nd technical round (1 hour):
- Given two strings check if both strings are same with atmost 1 character difference.
- Given an array of unique non-negative integers, {A1,...,An}, and a positive integer, X, write a function that finds all pairs of numbers in the array that sum to X.
He was going to ask another question but there was no time left for it so he skipped.
3rd Manager Round (1 hour):
- Introductions
- Basic Technical questions
- Some behavioral questions etc.
All the process took about a month.
Result: Got an offer in about 2 weeks.
The loop · 4 rounds
HackerRank: min knight moves in NxN grid; a sorting problem; a heap problem
Node value equals average of children; paint house (min cost RGB)
Strings differ by at most 1 char; all pairs summing to X
Behavioral + basic technical