0 like 0 dislike
680 views
| 680 views

0 like 0 dislike
MICROSOFT INTERVIEW EXPERIENCE |  SDE-1  | SELECTED | April 2022 | OFF-CAMPUS
Round 1 :-

CV selection, 1 coding round, 3 weeks mentorship program (similar to an internship), and based on your performance in the mentorship, there would be interview rounds (normal - 3 Technical rounds). All rounds (including interviews) were conducted on the Codility platform.

Coding Round (90 minutes):

Two questions were there ranging between medium-hard types

1. Almost similar to the "Session in BSU" (Educational CodeForces Round 49).

2. Given N points (can be collinear) in the 2D plane. We are required to find 3 points such that the triangle formed by choosing these 3 points should not contain any other points inside the triangle.

Concept: You have to find the 3 closest points. Consider any point as a 1st point, then find the 2nd one which is closest to it using the DISTANCE FORMULA. Now you have 2 points, find the 3rd one which is closest to both of them (using the same concept), and also keep in mind that points should not be collinear (you can easily do this by checking that the slope of points 1 and 3 should not be equal to the slope of points 2 and 3).

Technical Round 1:- 60 MIN.

1.Find the cousins in a binary tree: https://leetcode.com/problems/cousins-in-binary-tree/

2. The concept was same: https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/

Technical Round 2:-  60 MIN

1.Find the next permutation: https://leetcode.com/problems/next-permutation/

2.Find words in the matrix (for harder version, use Trie):
Word Search 1: https://leetcode.com/problems/word-search/
Word Search 2: https://leetcode.com/problems/word-search-ii/

Technical Round 3:- 45 minutes for the project and rest for the coding problem(TOTAL 60 MIN)

Detailed discussion on any one of the projects: Stacks and techs used, why you made this app, the problem faced, how did you manage to make your app efficient, database structure and schemas, functional and non-functional requirements, security, scalability, etc.

Problem very similar to this one: https://leetcode.com/problems/maximum-equal-frequency/

** Even if you are not able to write the complete and working code, show your approach. They tell you to write the code to see if you are able to write what you think.

Be positive and aloud during interviews. Don't be nervous and in a rush to answer the question. Take your time. Interviewers will help you whenever you get stuck. Believe in yourself and always in God.
by Expert (30,360 points)