Message on Whatsapp 8879355057 for DSA(OA + Interview) + Fullstack Dev Training + 1-1 Personalized Mentoring to get 10+LPA Job
0 like 0 dislike
850 views
All interview experiences Microsoft of  can be found using the tag "microsoft_interview_experiences" in the search bar.

Here is the link : https://www.desiqna.in/tag/microsoft_interview_experiences
in Interview-Experiences by Expert (34,270 points)
edited by | 850 views

1 Answer

0 like 0 dislike
Below is my interview experience at Microsoft consisting of 3 rounds. Prior to receiving an interview invite, a 3 week long mentorship period was also conducted where we had to build a working application on the given theme.

 

Interview Experience:

Round 1:

Given a string composed of a-z and also the letters B and C, where B denotes a backspace and C denotes a caps lock. The first 'C' denotes Caps lock on, then a second 'C' denotes caps lock off. Find the resultant string after resolving the string.
e.g. CrCellBax => Relax

Explanation: first C => caps lock on, therefore till now string becomes R, then second C => caps lock off.

Till now: Rell, B=> backspace => Relax

Kinda similar to this: https://leetcode.com/problems/backspace-string-compare/

2 . Given a snake sorted array, print the elements that lie within [low,high], low and high also included.

Snake sorted array:

1 2 3 4 5

10 9 8 7 6

11 12 13 14 15

(In zigzag manner)

Round 2:

Implement to_str() function in c++, i.e. integer to a string. Further discussion on some C++ concepts.
Sort array of 0 1 2.
eg. give array: 2 2 0 0 1 0 0 1 2 0 0 1

answer: 0 0 0 0 0 0 1 1 1 2 2 2

Round 3:

Design powerpoint.
Functionalities to support:

— add image, text

— modify image, text

— undo operation

Image as in not actual image, make an Image class that accepts the image path.

Discussion over memory performance.

Discussion on a question based on set.
 

The experience was great interviewing at Microsoft. I had my interview scheduled on 2nd Feb 2022, and I received my offer the very next day in the morning itself (^_^).
by Expert (34,270 points)