Microsoft can invest more in modern technologies.
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.
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
It was literally the most perfect interview experience of my lifetime. Imagine coding tutorials where no single error is made, but in real life. Overall, it was pretty easy. The people were nice, helpful, and interesting to talk to. The whole interv
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.
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
It was literally the most perfect interview experience of my lifetime. Imagine coding tutorials where no single error is made, but in real life. Overall, it was pretty easy. The people were nice, helpful, and interesting to talk to. The whole interv