← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Level: Mid-Level
Round: Onsite · Type: Multiple Types · Difficulty: 7/10 · Duration: 300 min · Interviewer: Neutral
Topics: Behavioral Questions, Object-Oriented Design, Palindrome, Graph Algorithms, System Design
Location: Seattle, WA, US
Interview date: 2026-01-15
Got offer: False
I recently had an onsite interview with Azure, consisting of three coding rounds and one system design round.
Round 1: The behavioral questions went well, but then I was asked OOD questions. I was completely unprepared, as interfaces and abstract classes are my weak points. My answers were disorganized.
Round 2: This round consisted of behavioral questions and a coding question. I was asked to determine if a number is a palindrome (e.g., 1221, 999). The follow-up question was how to find the smallest palindrome number larger than a given input number (e.g., 132 -> 141).
Round 3: I felt this was a hard-level question. Given a graph with edges, the graph contains a cycle. I needed to return the distance from each node to the cycle; nodes within the cycle should return 0. I considered using Topological Sort, but I got stuck on how to find the cycle. The interviewer gave me a hint about pruning. I was able to write the code, but it had bugs.
Round 4: System design: Ticketmaster.