Great environment to learn a lot from teammates and trainings.
Chance to work with some quite talented engineers/managers.
Great place to learn disciplined and structured software engineering.
Flexible work schedule and they care about work-life balance.
It really depends on your team and managers.
In good teams, you can work on great projects that have a big impact on the company/industry and make you feel satisfied. You can also work with talented and nice teammates from whom you can learn a lot.
With great managers, you can have a great career path in this company and get promoted more easily (compared to those who don't have good managers).
And make sure you're really interested in programming on Windows.
Train more great leads and managers. Make the company cooler and more fashionable. Find more projects that have better impact on the company and industry.
Standard interview with two coding questions. Had another round with a manager who asked a lot of questions related to my past project experience, which went into a lot of detail.
Microsoft’s SDE process usually goes: recruiter screen, (for new grads) an online coding test, then 1–2 technical rounds, followed by a 3–5 interview onsite loop covering coding/algorithms, system or OOP design, and behavioral. After a hiring debrie
First, there was an Online Assessment. After cracking the coding round, one question was related to Kadane's algorithm. The second question was related to finding local minima in a grid. I did it in O(N) time complexity and O(log n) space complexity.
Standard interview with two coding questions. Had another round with a manager who asked a lot of questions related to my past project experience, which went into a lot of detail.
Microsoft’s SDE process usually goes: recruiter screen, (for new grads) an online coding test, then 1–2 technical rounds, followed by a 3–5 interview onsite loop covering coding/algorithms, system or OOP design, and behavioral. After a hiring debrie
First, there was an Online Assessment. After cracking the coding round, one question was related to Kadane's algorithm. The second question was related to finding local minima in a grid. I did it in O(N) time complexity and O(log n) space complexity.