Microsoft

Round 1 1. Print all substrings of a given string. 2. Add two numbers in the form of a Linked List. Round 2 Find the minimum number of platforms required to accommodate all the vehicles, given their arrival and departure times. Time and space com

Microsoft Interview Process Round 1: Problem Solving, Algos, and DS Round 2: Low-Level Design Round Round 3: Problem Solving, Algos, and DS - called "Fly No Fly" Round Round 4: Hiring Manager Round

First round DS Algo. They scheduled a Zoom call. The Diagonal Level Sum problem took me 30 minutes to build the algorithm and code. The second question was difficult, as it asked me to design an optimal strategy to reach the Hagman solution.