Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Microsoft interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Microsoft
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: Data Structures, DBMS, Algorithms, Dynamic Programming, Pointers
Tip
Tip

Tip 1 : Do it consistently. Don’t do practice in breaks.
Tip 2 : Try to solve the problem by yourself don’t jump on the solution directly.
Tip 3 : Do some Frontend or Backend projects to show some work that you have done.

Application process
Where: Campus
Eligibility: Good CGPA
Resume Tip
Resume tip

Tip 1 : keep it short, up to the point
Tip 2 : put some projects there and mention things in bold that you want to show to the interviewer

Interview rounds

01
Round
Medium
Online Coding Test
Duration120 Minutes
Interview date10 Nov 2022
Coding problem2

Late Night

1. Number Of Vehicles

Easy
15m average time
85% success
0/40
Asked in companies
Tata Consultancy Services (TCS)AccentureMicrosoft

There is a person named Bob who is the mayor of a state. He wants to find the maximise number of vehicles that can be registered in his state.

View more
Try solving now

2. Unique Paths

Moderate
25m average time
80% success
0/80
Asked in companies
CiscoAmazonAtlassian
View more
Try solving now
02
Round
Medium
Video Call
Duration60 Minutes
Interview date1 Dec 2022
Coding problem1

1. Detect and Remove Loop

Moderate
10m average time
90% success
0/80
Asked in companies
IBMDelhiveryAmerican Express

Given a singly linked list, you have to detect the loop and remove the loop from the linked list, if present. You have to make changes in the given linked list itself and return the updated li...

View more
Problem approach

1. This method is also dependent on Floyd’s Cycle detection algorithm.
2. Detect Loop using Floyd’s Cycle detection algorithm and get the pointer to a loop node.
3. Count the number of nodes in the loop. Let the count be k.
4. Fix one pointer to the head and another to a kth node from the head.
5. Move both pointers at the same pace, they will meet at the loop starting node.
6. G...

View more
Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Is method overloading possible by changing the return type?

Start a Discussion
Similar interview experiences
company logo
SDE - 1
5 rounds | 15 problems
Interviewed by Microsoft
1473 views
0 comments
0 upvotes
company logo
SDE - 1
5 rounds | 7 problems
Interviewed by Microsoft
1041 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 2 problems
Interviewed by Microsoft
5383 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 7 problems
Interviewed by Microsoft
203 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
101640 views
24 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
29910 views
6 comments
0 upvotes
company logo
SDE - 1
3 rounds | 11 problems
Interviewed by Amazon
20078 views
3 comments
0 upvotes