Microsoft Software Development Engineer I Interview Questions

25 Interview Reviews

Interview Experience

Interview Experience

61%
22%
16%

Getting an Interview

Getting an Interview

70%
11%
11%
5

Interview Difficulty

3.0
Average

Interview Difficulty

Hard

Average

Easy

25 Candidate Interview Reviews Back to all Interviews

Sort: Popular Date Difficulty

 

Software Development Engineer I Interview

Anonymous Employee
No Offer

Application

I applied through college or university. I interviewed at Microsoft.

Interview

Had the chance to do a phone interview with MS in my 2nd year. there were not many tech question as i was expected. instead, the interviewer asked quite a lot about my tech related background and some general knowledge about programming.

Interview Questions

Other Interview Reviews for Microsoft

  1. Helpful (2)  

    Software Development Engineer I Interview

    Anonymous Interview Candidate in Chennai (India)
    Accepted Offer
    Positive Experience
    Easy Interview

    Application

    I interviewed at Microsoft (Chennai (India)) in July 2012.

    Interview

    Microsoft 24-07-2012 Round 1 30 quans + 20 programming aps 1 hr (online) 25-07-2012 Round 2 3 programs (online): 1. Enumerate the given String to Ascending order without repetition. Input : accommodate Output : acdemot 2. Given a sorted array in which a part of the sub-array is reversed. Fix it. Input : 1,2,3,4,7,6,5,8,9 Output : 1,2,3,4,5,6,7,8,9 3. Sorted Doubly Linked List to BST. 25-07-2012 Round 3 3 programs (written): 1. Given an array and a number N, say whether there are tuples with difference equal to N. 2. Insertion in Sorted circular singly linked list. 3. Given a node in a BST print the leftmost node in the same level of the given node. 30-07-2012 Round 4 2 programs (written): 1. Given a linked list with a next ptr and an arbitrary ptr, Clone it. 2. Decimal to Hexadecimal Conversion. Hereafter all rounds are face-face with HR…. 30-07-2012 Round 5 (OS) 1. Problem related Swap space management. 2. Thrashing. 3. Multi-threading concept. 4. Code using Semaphores. 5. Test cases for the above code(using diagram) and explanation. And finally abt “Final Year Project” 30-07-2012 Round 6 1. Given a BST with 2 node values swapped. Find and fix it.. (Note: Include all the test cases) 2. Keyboard inputs are given one by one. After getting the 10th input, print all the inputs in reverse. 3. Intersection point of Two Linked Lists. 30-07-2012 Round 7 1. Given a graph and two nodes, find the number of distinct path between those two nodes. 30-07-2012 Round 8 1. Majority element in an array. (Given array of length n, Find whether an element in the array occurs atleast n/2 times)

    Interview Questions

    • The interview was over and he said that I did well and I was most likely to be hired. I was very happy and in ten minutes the HR said that I was selected :)   Answer Question
  2. Helpful (6)  

    Software Development Engineer I Interview

    Anonymous Employee in Hyderābād (India)
    Declined Offer
    Neutral Experience
    Average Interview

    Application

    I applied through a recruiter. The process took 2 weeks. I interviewed at Microsoft (Hyderābād (India)) in April 2012.

    Interview

    A recruiter reached me via linkedin and scheduled a f2f interview two days later in a hotel. Had five rounds of technical discussion (each 1 hour) and they told there may be one more round (may be technical). 1week later they scheduled a video call with a director (but it was actually an audio only with screen sharing). We talked about some design level ideas then he asked a technical question. I was running into trouble to setup the video call because I'd a mac (hope you understand because the video call tool was developed by MS).

    Interview Questions

    • Imagine there are n cities (say c1, c2....cn) connected circularly and each of them has a petrol bunk (say p1,p2...pn). The distance between each cities are d1, d2...dn. Here 1unit of petrol will be used to travel 1unit of distance. You can start from any city so that you can go through all of them and reach the same location (city). Find from where we've to begin the navigation. FOR EXAMPLE: c1-->c2-->c3-->c1 p1 has 2ltr p2 has 10ltr p3 has 4ltr and the distance between each cities: c1<-->c2: 3 c2<-->c3: 2 c3<-->c1: 8 Here we've to start at c2 in-order to come back again to the same place. Explain the logic to find whether u can come back to the same location. Find where to start. Write a program for the same. Write test cases for the same.   1 Answer
    • You're converting a string (s1) into another (s2) by changing the characters in s1. You can do add/delete/replace the characters of s1 to get s2. The cost of any of those operation for a character is 1. Find the minimum cost to convert s1 into s2. Write program and test cases for the same. For example: Convert "Hi" into "Hey". This would require minimum two cost. 1. Replace 'i' with 'e' in s1 2. Add 'y' to s1. Now we've s2.   1 Answer
    • Write a program to iterate through a 2D grid in a spiral way. Since I can't attach images here, I'll explain it using an array. Imagine you've a nxm matrix of bytes. you've iterate through it in a spiral way. It means, iterate the first row (left to right), then iterate through the right most column (top-bottom) then iterate the bottom most row (right-left) until you reach the center of the matrix. Hope its clear now.   1 Answer
    • You've a singly linked list where every node in the list has a field "random" which points to other node in the same list. Write a function to clone this list (create a new copy of the same). Don't use extra space (just the pointer variables are fine).   3 Answers
    • Some other standard questions: 1. Given a BST and a range, print all the numbers that comes in that range. Ex: the function will be something like: print(node * head, int x, int y); It has to print all numbers within the rage x&y 2. Print max height (level) of a binary search tree. 3. Given an array of integers, determine the sub array which makes max sum. 4. Find LCA of the binary search tree.   1 Answer

    Reasons for Declining

    Salary was less. They were just matching my CTC and it required relocation.

  3.  

    Software Development Engineer I Interview

    Anonymous Interview Candidate in Allahabad (India)
    Accepted Offer
    Positive Experience
    Average Interview

    Application

    I applied through college or university. The process took 1 day. I interviewed at Microsoft (Allahabad (India)) in October 2011.

    Interview

    2-3 elimination rounds followed by a final manager round. General algorithm questions asked in elimination rounds followed by a possible design round and some OS/compiler related theoretical questions.

  4. Is this helpful? The community relies on everyone sharing – Add Anonymous Interview Review


  5.  

    Software Development Engineer I Interview

    Anonymous Employee
    No Offer
    Negative Experience
    Easy Interview

    Application

    I applied online. The process took 4 weeks. I interviewed at Microsoft in August 2011.

    Interview

    I applied online and was contacted by a recruiter for a phone interview. The interview was great to me, and the interviewer said I will have the result about 3 weeks later. 4 weeks later, still no response. I sent 2 follow-up emails after that, still no response. Very professional, Microsoft.

    Interview Questions

    • why do you want to work at MS?   Answer Question
    • what technical difficulty you have faced in your past projectS? how did you overcome it?   Answer Question

See What Microsoft Employees Are Saying

    Former Product Advisor

Pros: “awesome management - great people to work with !”“awesome management - great people to work with !” – Full Review

Don't Miss Out On a Job You Love
Upload a resume to easily apply to jobs from anywhere. It's simple to set up.

The difficulty rating is the average interview difficulty rating across all interview candidates.

The interview experience is the percentage of all interview candidates that said their interview experience was positive, neutral, or negative.

Your response will be removed from the review – this cannot be undone.