Microsoft

Focus on Data Structures and Algorithms. Knowledge of BSTs, stacks, and hash tables is essential. Graph Algorithms and Dynamic Programming are covered too. I was asked a question on Topological sorting (implement it with and without stacks) and an

The interview process consisted of several stages: First, a 15-minute recruiter phone call to discuss the position and explain the interview process. Second, a coding challenge comprising 3 medium LeetCode questions. Third, four rounds of technica

The interview went smoothly. The office and the location were nice. There were four interviewees. The questions were too easy, and the offered salary was too low. However, they gave some presents. I spent a nice day sightseeing in Prague.