Open In App

Microsoft Interview Experience | Set 57 (For SDE)

Last Updated : 08 Jul, 2015
Improve
Improve
Like Article
Like
Save
Share
Report

Round 1 (45 mins)
1) There was a detailed discussion on the project i did at Microsoft and also over the two projects mentioned in my resume.

2) There is a Bing log file containing the domain names. Design a cache memory system for faster dns look ups.( i suggested a Trie and a min heap based solution).
I was asked to make it space efficient. (I replaced trie with map)

3)There is a turn based 2 player game in which there are 9 pins and each player is allowed to pick either 1, 2 or 3 pins only. The last player to pick the pin is the loser.
Design winning strategy for such a game.

4) Generalize the above solution for n pins.

Round 2 (45 mins)
1)There is a large file with system memory limitations. How will you store it (i suggested Distributed system) and how will u work on it.

2)Suppose the large file contains name, address, Dob, pan no etc as attributes. Design class interface for such a system.The question was re framed again with more conditions which i am unable to recall now.

2)There was a detailed discussion over how the stl map data structure is implemented.

3) Discussion over hashing and collision resolution techniques.

Round 3(40 mins)
Discussion over my project followed by these questions:
1) Write the code to delete nodes in a binary tree which don’t lie in any path from root to leaf with sum>=k.

2)There is a rotated and pivoted array. Write the code to determine how many times the array is rotated. (i did it in O(log n)).

All thanks to geeks4geeks for helping me prepare for technical interviews.


Previous Article
Next Article

Similar Reads

Microsoft Interview Experience | Set 151 (SDE-2 3.5 years experience)
Round 1: Place all numeric characters in string before alphabet characters . Using min swaps and O(1) space and Maintain the order of characters. Round 2: Median of stream of integers. Discuss algo. Shortest common supersequence of 2 strings. Discuss recursive Time complexity and write code for best approach decided. Round 3: Merge 2 sorted linked
1 min read
Microsoft Interview Experience | Set 169 (SDE 2 for 3.5 years experience)
1st round(online coding): Given an array that contains both positive and negative integers, find the product of the maximum product subarray. Sort an almost sorted array where only two elements are swapped. Given an integer value and a pointer to the head of the linked list, delete all the nodes from the list that are greater than the specified val
2 min read
Microsoft Interview Experience | Set 172 (Off-Campus for SDE 1)
An employee( alumnus of our college ) had taken CVs of interested students from CSE and IT department. A few students were shortlisted for the online round. Round 1 ( CoCube Online Round ) Question 1: Basic question on Strings. Cake walk completely. Question 2: Easy question on Linked List. Adding two numbers. Read https://www.geeksforgeeks.org/sum
5 min read
Microsoft Interview Experience | Set 51 (For SDE Intern)
Recently Microsoft visited our campus for SDE intern. The process took over 4 months. Round 1 (Online MCQ's) Time-30 mins This round consisted of 25 questions on C,C++,Aptitude(Probability) and OS. 60 students out of 150 were shortlisted for the next round. Round 2 ( Online Coding Round) Time-90mins 1) Write a function to check whether the string i
4 min read
Microsoft Interview Experience | Set 54 (For SDE)
Round 1 (45 mins): Tell me about yourself. 1. Given an array of strings with R, G & B as characters. Sort the array such that all R comes first, followed by Gs & followed by Bs. Do it in O(n) time complexity. (Paper Code) For eg. array is: I/P: G G R B R B B G R B R O/P: R R R R G G G B B B B Hint: Same problem as sorting strings of 0s, 1s
6 min read
Microsoft Interview Experience | Set 56 (For SDE 2)
First Round (F2F) 1 hour: ---------------------------------- 1. Given an image with a lot of pixels, find all the pairs of pixels that are strongly connected. 2. Given an N-ary tree with thousands of nodes, pair the leaf nodes which do NOT SHARE the common path. i.e. Two Leaves can be Paired only if they do NOT have a common edge that was used in a
3 min read
Microsoft Interview Experience | Set 64 (For SDE-2)
First Round (F2F) 1 hour: ———————————---------- Write code for below 2 qns , not exact but concepts are 99% same. https://www.cdn.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/ https://www.cdn.geeksforgeeks.org/find-number-of-islands/ Second Round (F2F) 1.5+ hour(Design round): ———————————------------- Asked me to design a URL shortening site lik
2 min read
Microsoft IDC Interview Experience | Set 68 (For SDE)
Hi, Following is my interview experience for SDE position in Bing Team. - Online Round : Total questions 2. The question was big, like a story but it ultimately boils down to Longest Common Subsequence. Don’t remember the question but it was a mix of level order traversal + searching. - Onsite : Round 1 : Duration around 1 hour Given a binary tree,
4 min read
Microsoft IDC Interview Experience | Set 69 (For SDE)
Position : SDE BING TEAM 1. Online round : This was for screening and had 2 questions: i) max sum product of an array -> (take care of negative no.) ii) Bridge building problem across cities. 2. F-F round 1 i) interviewer asked me why microsoft and why bing. ii) reverse linked list in size of k iii) design question on array of finding an element in
2 min read
Microsoft Interview experience | Set 73 (On-Campus for IT SDE Intern)
MSIT visited our campus. 5 days before the visit, there was an online assessment which included two processes both hosted by cocubes: 1. MCQ round: It had 15 questions from c,c++ and java to be done in 30 minutes. Mcq were easy but long so time consuming.There was no negative marking. I solved around 8-9. After half an hour results were announced.5
2 min read
Practice Tags :