The loop had no bar raiser, which made it look simpler on paper. Most rounds were DSA with a smaller set of low-level, product-style questions.
The OA involved simulation-like grouping and sorting. In the live rounds, I found a median in an integer stream and identified the K most frequent elements in a stream. The low-level portion included implementing a sliding-window rate limiter.
It felt straightforward and did not surprise me. I did not get an offer, but it was a clean test of fundamentals and careful implementation rather than chaotic guessing.
Location: Hyderābād. Overall feedback: positive. Offer status: no offer.
Discussion
Loading comments…