microsoft logo
Microsoft· SDE 1

Microsoft | SDE 1 | Bangalore | November 2021

Result
Offer
Location
Bangalore
Posted
24 Nov 2021
285 reads

Summary

I successfully navigated an off-campus SDE 1 interview process at Microsoft in Bangalore during November 2021. The selection included a coding assessment, a 3-week mentorship program, and three subsequent technical rounds focused on Data Structures & Algorithms and project discussions, ultimately leading to a positive outcome.

How it went

My Microsoft FTE interview journey started with an off-campus application via the Microsoft Engage Program. After clearing a coding assessment, I was assigned a mentor for a 3-week program where I had to showcase my work. Performing well during this mentorship was crucial, as it determined eligibility for further interviews. Luckily, I received a direct interview call post the coding round. All assessments and interviews were conducted on the Codility platform.

The initial Coding Round lasted 90 minutes and featured two medium-hard problems. I managed to solve both of them within 40 minutes. One problem was almost similar to 'Session in BSU' from Educational CodeForces Round 49. The second problem asked me to find three non-collinear points in a 2D plane such that the triangle formed by them contained no other points. My approach involved finding the three closest points and ensuring non-collinearity by checking slopes.

Technical Round 1, focused on Data Structures and Algorithms, surprisingly concluded within 20 minutes. I was asked to find cousins in a binary tree, which linked to a LeetCode problem, and another problem whose concept was similar to 'Minimum Number of Arrows to Burst Balloons'.

Technical Round 2, another DSA round, required almost the full hour to write the working code. The problems included 'Next Permutation' and variations of 'Word Search'. For the Word Search problems, I considered both 'Word Search I' and 'Word Search II', noting that a Trie approach could be used for the harder version.

Finally, Technical Round 3 was a mix of project discussion and DSA, lasting approximately an hour. About 40-45 minutes were dedicated to an in-depth discussion about one of my projects. This covered the tech stack, my motivation, challenges faced, how I ensured efficiency, database design, functional and non-functional requirements, security, and scalability. The remaining time was spent on a coding problem, which was very similar to 'Maximum Equal Frequency' on LeetCode.

Throughout the interviews, I made sure to stay positive and articulate my thoughts clearly. I was advised not to rush answers and to take my time, as interviewers were supportive and offered help when I got stuck. It reinforced the importance of believing in oneself.

Questions asked (9)

  1. 01

    Session in BSU (Similar)

    Data Structures & Algorithms

    A problem almost similar to 'Session in BSU' from Educational CodeForces Round 49.

  2. 02

    Find 3 Points Forming Empty Triangle

    Data Structures & Algorithms

    Given N points (can be collinear) in the 2D plane. Find 3 points such that the triangle formed by choosing these 3 points should not contain any other points inside the triangle. The concept involves finding the 3 closest points: start with any point as the first, find the second closest using the distance formula, then find the third closest to both, ensuring no collinearity by checking slopes.

  3. 03

    Cousins in Binary Tree

    Data Structures & Algorithms

    Find the cousins in a binary tree.

    Open the problem
  4. 04

    Minimum Number of Arrows to Burst Balloons (Similar Concept)

    Data Structures & Algorithms

    A problem with a concept similar to 'Minimum Number of Arrows to Burst Balloons'.

    Open the problem
  5. 05

    Next Permutation

    Data Structures & Algorithms

    Find the next permutation.

    Open the problem
  6. 06

    Word Search

    Data Structures & Algorithms

    Given an m x n grid of characters and a word, return true if word exists in the grid.

    Open the problem
  7. 07

    Word Search II

    Data Structures & Algorithms

    Given an m x n board of characters and a list of strings words, return all words in the board. (For harder version, use Trie).

    Open the problem
  8. 08

    Project Discussion

    Other

    Detailed discussion on one of my projects, covering tech stack and technologies used, motivation behind the app, problems faced, efficiency improvements, database structure and schemas, functional and non-functional requirements, security, and scalability.

  9. 09

    Maximum Equal Frequency (Similar)

    Data Structures & Algorithms

    A problem very similar to 'Maximum Equal Frequency'.

    Open the problem

How they prepared

My preparation largely leveraged various online platforms. I found LeetCode, GeeksforGeeks (GFG), CodeChef, and CodeForces to be invaluable resources for practicing coding problems and understanding different algorithms and data structures.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Microsoft recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!