Open In App

Microsoft Interview Experience | Set 109 (2 years experienced)

Last Updated : 20 Dec, 2018
Like Article

Round 1 (Telephonic)

  1. What is LRU. How to Implement it.
  2. Find kth smallest element in an array.
    Solution: GeeksforGeeks Link
  3. In a file, there are two columns, first column has some word (String) and 2nd column has some value (Double).
    Example :-
    ABC 23.4
    ERF 34.89
    WERT 122.9
    Now user wants some arithmetic operations like 
    1) ABC + ERF = 23.4 + 34.89 = 58.29
    2) ABC - WERT = 23.4 - 122.9 = -99.5
  4. Design an efficient DS for these kind of operations.

Round 2 (F2F)

  1. Asked about current Project.
  2. Given a string str. You have to make this string to square string with maximum length. A square string is of the following format:
    str = x + x; where x is any string. Return length of this square string.

    str = ababa
    Max length square string = 4;
    str = abcd
    Max length square string = 1;

Round 3 (F2F)

  1. Asked about current project. Asked to draw architecture of my project. Then Asked to design a new feature that is currently not there in my project.
  2. Design undo and redo operation in Microsoft Word like text editor.
  3. Design Hit Counter. (Design Hit Counter)

Round 4 (F2F)

  1. Asked about current project.
  2. You are given a text file. You have to return the list of starting index of the given word in text file. Design an efficient DS for that.
    Example :-
    Text file content : "geeks for geeks"
    word : "geeks"
    List : {0,10}

Previous Article
Next Article

Similar Reads

Microsoft Interview Experience | Set 154 (For 1.5 Years Experienced)
I applied for the position of Software Engineer at Microsoft IDC, Hyderabad, given 1.5 years of my experience. My rounds were of intermediate level I guess. Round 1: Hackerrank test There were 1 questions in this round. 1.) First question was based on strings. Given a string of characters, there will be a roll function given to you. The roll functi
6 min read
Microsoft interview experience: | Set 167 (7 Years Experienced)
Round 1: k frequently words in a given file of huge data. Find index of distortion in a sorted but a little bit distorted array. Round 2: First non repeated character in character stream of huge data. Design of URL shorter service . Round 3: Projects Round 4: with Technical partner manager . - island problem in a mxn matrix of integers - image comp
1 min read
Microsoft IDC interview Experience | Set 47 (For 1.7 Years Experienced)
For Microsoft Bangalore CRM team. Experience: 1.7 years. Round 1:(Written test) Question 1 : Given a binary search tree . Print its level order traversal in reverse order level wise .eg if level order is 1234567 then required output was 1327654 Question 2: Given a binary search tree , Print its zig zag traversal . Complete syntactically correct cod
3 min read
Microsoft interview Experience | Set 48 (For 1.5 Years Experienced)
Here goes my experience. Skype Round: 1) Level order traversal of a binary tree. Extend or modify the code to zig zag traversal. Face to Face Round 1 : 1) Questions about my previous work. 2) Sort an array of 0's, 1'
1 min read
Microsoft Interview Experience | Set 111 (For 1.5 Years Experienced)
Position: Software Engineer - 2(Big Data Team, Bangalore) I applied through referral. Got a call within a week. Round-1(Skype-Bangalore)(~45Mins) The interviewer directly asked me to explain about my current project. 5-6 questions from there. My project was based on cloud computing so, He asked me some basic questions about cloud computing. About t
5 min read
Microsoft Interview Experience | Set 112 (For 4.5 Years Experienced)
Round 1: Common Node in 2 Linked List Clone Linked List which has random pointer Round 2: Spam Filter design LCA of Binary Tree LCA of BST Round 3: Number between twin primes is divisible by 6 or not. Proove it Question on Threads Scheduler Design Round 4: Detect Misspelled localities from the 1000s of given addresses Data structure design for 'Aut
1 min read
Microsoft Interview experience | Set 114 (2.5 Years Experienced for SDE2)
1st Round :- (1 hr) There is a graph where each node represents a city and it contains specific no. of people. A tournament is going on and each match is playing in one city. All city's people gather to watch match. Traffic department wants to manage how many people travel through city x if match is playing in city y for each x. City x and y can be
4 min read
Microsoft Interview experience | Set 115 (4 Years Experienced for IDC)
1st Round : 1) 2) 3) Delete all nodes whose value is greater than K 2nd Round (1 hr 30 mins) 1) Clone a Binary Tree 2) There is a rack of shelves having balls of red and blue in each row . Retrieve all
2 min read
Microsoft Interview Experience | (SDE-2 for 3 Years Experienced)
I had got a call through Naukri Portal . I got interview invite for a weekend drive. Round 1 Hacker rank test : Q1 : Given relationship of child-parent for a tree for all nodes. Find the diameter of that tree. Q2 : 3 more MCQs in test. Round: 2 Q1: Given a n-ary tree. Find the l
2 min read
Microsoft Interview Experience (3 years Experienced)
Team Name: Azure DevOps Round 1 Given an array of probability distribution, generate a function to return a char with given probability. str=[‘a’, ’b’, ’c’] probabilityDistribution =[50, 25, 25] 4 outputs when called 4 times =a, a, b, c. Create a fu
1 min read