Expedia SDE-3 Gurugram — eliminator + DSA + design; offer

Current => YOE 4.5 (Product Based companies) | TC 32 LPA

1st Round (DS Algo - Eliminator)

1. Given array of 0's and 1's and a number K, find the maximum length of consecutive 1's by flipping at most K 0's. (prefix sum -> sliding window)
2. Calculate maximum amount of money thief can steal from street. Cannot steal from consecutive houses. Street is circular (if pick 1st cannot pick last). (circular house robber DP)

2nd round - (DS Algo)

1. Find all palindromic substrings of string. Example input "leetcode" -> ['l','e','e','t','c','o','d','e','ee']. (brute force O(n^3) -> two pointers expand around center)
2. Anagram problem, hashing/implementation based, custom hash function and counting (~130-150 lines).
3. Consider a garden as a straight line, at each point a sprinkler with power p[i] covers (i-p[i], i+p[i]). Calculate the minimum number of sprinklers to water the whole garden. (precompute ranges then pick minimum non-overlapping intervals / greedy jump)

3rd Round - (Design HLD-LLD)
Design Zerodha like system end to end with low level design. Functional requirements (register, buy/sell stock, view portfolio, fetch live stock data), NFRs (consistent, scalable, available, data recovery), classes/ER diagram/DB design, then LLD follow-ups: data recovery if a cluster goes down in a region, scalable notification when stock fluctuates, limitations from stock-exchange API availability, circuit breaker if an exchange is down.

4th Round (HM)
Intro, tech journey, current project deep-dive (tech, db choice, scale, bottlenecks, learnings), STAR problems (conflict handling, competing priorities), code review + CI-CD, why Expedia.

Got email within 24 hours of selection.