(Translated by https://www.hiragana.jp/)
Microsoft Interview Experience | Set 89 (For SDE-2) - GeeksforGeeks
Open In App

Microsoft Interview Experience | Set 89 (For SDE-2)

Last Updated : 12 Aug, 2024
Summarize
Comments
Improve
Suggest changes
Like Article
Like
Save
Share
Report
News Follow

First of all I thank GeeksForGeeks for giving right direction in Making my dream true.

Got short listed from a consultancy and They have shared a link of Microsoft where I have to submit the online test.

Online test has 2 questions need to be completed in 1hour

  1. Did not remember
  2. BST Tree Inorder is given need to print all possible BST trees from the above tree which have same elements.

Submitted psudo code and got short listed for interview.

———————————————————————————————————————-

10-30 AM interview started.

  1. String is given need to print maximum length of string ( sub string) which is not palindrome
    Solved o(n2) asked for optimization and code followed by test cases.
  2. Discussion on abstration and interfaces

11 – AM

  1. Double linked list swap pair wise data
  2. Double linked list swap pair wise links
  3. Test cases ( i told list can have bad links)
  4. verify for list is proper or not then loop detection
  5. discussion on projects

2 PM

  1. tool kit of nuts and bolts need to find the matching pairs of all.
    given o(n2) asked for optimization and code.

4-30 PM

  1. discussion on projects
  2. Compression algo for image data
  3. Thread synchronization for producer many consumers (extension of producer consumer problem)
  4. Find near to me restaurants approach ( told some approach using graphs which i also did not satisfy 🙂 ).
  5. Server is replaced with MS server in place of MAC server then how MAC client can use MS services design ( told adapter way).

5-30
Offer discussion…..



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 SDE-1 to SDE-2: Roles, Responsibilities and Salaries
Microsoft is a global leader in technology and software development, known for products like Windows, Office, and Azure. The company employs over 180,000 people worldwide, showcasing its massive scale and influence in the tech industry. Currently, Microsoft is focusing on cloud computing, AI, and sustainability initiatives, positioning itself for f
12 min read
Microsoft SDE-2 to Senior SDE : Roles, Responsibilities and Salaries
Microsoft Corporation is a global powerhouse in the technology sector, headquartered in Redmond, Washington. It is renowned for its wide array of products and services, including operating systems, office suite software, and cloud computing solutions. As one of the principal players in the U.S. information technology landscape, Microsoft stands alo
11 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 135 (For SDE II)
This was for Bing team. First Round-(Skype Call) 3 PS/DS questions. All of them were questions which involved application of standard problems. After that I was called to Hyderabad for a day long drive. 3 Interviews with managers, 1 with partner. First Round- A book is given, write a function where input is line number and output is content of the
1 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 57 (For SDE)
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 re
2 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
Microsoft Interview Experience | Set 75 (For SDE II)
I recently attended Microsoft Interview for their CRM team in Bangalore. F2F Round 1: Design and Implement: Producers and Consumer Problem. Producers produce different kind of messages and Consumers register themselves for different kind of messages. Need to design and implement Producer, Consumer and a Delegator which is responsible for storing an
2 min read
Microsoft IDC Interview Experience | Set 88 (For SDE-1)
Position : SDE BING TEAM 1. Skype round :  Brief about agile software development process (as mentioned in my CV) Detect whether the linked list is circular. Check whether the number is a power of 2. Check whether two trees are identical. Given an array which is first increasing and then decreasing, find the index where it changes from increasing t
2 min read
Microsoft IDC Interview Experience | Set 88 (For SDE-2)
Total experience : 8 Years. Interviewed for : SDE-2 Face to Face Round 1: Tell us about your project and specific contributions. How to find intersection of link list. Length of the longest substring without repeating characters. Face to Face Round 2: Tell us about your project and specific contributions. Remove characters from the first string whi
1 min read
Microsoft Interview experience | Set 120 (For Senior SDE)
1. Smallest non negative number in a array 2. Given a grid with costs in each cell.You can enter through any item in Row 0 and exit through any row n-1. Find the minimum cost path 1. Connect all nodes at same level in a Binary Tree 2. Median in a running stream of numbers 1. Design a group chat both front end and back end. All Practice Problems for
1 min read
Microsoft Interview | Set 37 (For SDE-1)
Skype round: 1) Print the last n lines of a file (Hint : treat it like a linked list) 2) Length encoding - Input: aaabbc Output: a3b2c1 F2F round 1: 1) Given a few points in first quadrant - (x1,y1) .....(xn,yn) and given another set of points (a1,b1.....an,bn), determine whether all the points (a1,b1...an,bn) have already occured in (x1,y1).....xn
2 min read
Microsoft Interview Experience for SDE
Round 1: There was a codility round with 2 questions for 100mins, question level medium. Round 2: Live coding on codility, 1 leetcode hard question was asked. Question: https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/ Round 3: Live coding on codility, 2 questions were asked medium-hard level. Question 1: Given an array of repre
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 : https://www.geeksforgeeks.org/maximum-difference-between-two-elements/ 3 more MCQs in test. Round: 2 Q1: Given a n-ary tree. Find the l
2 min read
Microsoft Interview Experience for SDE
I arrived at the Microsoft campus early in the morning and was greeted by the friendly receptionist who directed me to the interview room. I was excited, yet nervous about the upcoming interviews. Round 1: Technical Interview My first interview was a technical interview with a senior SDE from the team I would be joining. The interviewer began by in
2 min read
Microsoft Interview Experience (SDE II)
Round 1: First round was machine test that comprised 3 questions. Given an array of numbers in range (0 – 49) and queries having start index and end index, find maximum element for each query. (I used square root decomposition). Given N natural numbers, 1 is missing, find the number. Then, the interviewer expanded the problem to find 2 or more miss
3 min read
Microsoft-IDC Interview Experience-SDE profile (on-campus for FTE)
Microsoft visited NIT Jalandhar on 6th August, 2018 for hiring. approximately 250 students were eligible for 1st round. Round 1: (coding round) (75 MINUTES)It was conducted on cocubes platform. there were different sets of questions and every set had three questions. I got following questions: Given a string find the number of occurrences of regex'
3 min read
Microsoft Interview Experience | SDE - 2018
A big thanks to GeeksForGeeks ! Here is a small contribution from my side. This is regarding On campus placements, from an Indian Institute of Technology. Round 1: 3 Coding Question https://www.geeksforgeeks.org/segregate-even-and-odd-elements-in-a-linked-list/  (5 Marks) https://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjac
3 min read
Microsoft Interview experience for SDE-2 (5+ years)
I had attended a Microsoft hiring event for Hyderabad location and Azure team. My experience is as follows: F2F First round : 1. https://www.geeksforgeeks.org/zigzag-tree-traversal/ 2. https://www.geeksforgeeks.org/find-maximum-path-sum-two-leaves-binary-tree/ F2F Second round : 1. We have given a matrix with positive numbers and few -1 in it. we n
1 min read
Microsoft Interview Experience | SDE-II
Round 1(DSA, Design, Java) 1. Write a code to find kth largest element in an array. Interviewer was interested in the most optimal solution straight away along with writing code for all the heap operations from scratch.https://www.geeksforgeeks.org/k-largestor-smallest-elements-in-an-array/ 2. Write a code to merge k sorted arrays of size n. Used t
3 min read
Microsoft Interview Experience (SDE Intern-2020-On Campus )
Microsoft was the very first company which arrived our campus in the 2019-20 season. It was open to all CSE, IT, EE and ECE with a CGPA of 7.0 and above. Round 1: It was an online round hosted on https://tests.mettl.com/ .There were 3 questions with a duration of 90 minutes and to qualify, one have to solve around 1 and half. But some get shortlist
5 min read
Microsoft Interview Experience (FTE SDE 2020- On Campus)
Microsoft came to our campus on 31st of July 2019 . It was open for students of nearly all the branches having CGPA 7 or above. Round 1: It was an online coding round hosted over site “ mettl ” . There where 3 coding questions and with a duration of 90 mins. 1st question was finding maximum distant coordinate pair from a given number of coordinates
5 min read
Microsoft Interview Experience for SDE-2
Location: Hyderabad Round 1: https://www.geeksforgeeks.org/connect-nodes-at-same-level/ Round 2: https://www.geeksforgeeks.org/decode-string-recursively-encoded-count-followed-substring/ https://www.geeksforgeeks.org/find-possible-words-phone-digits/ https://www.geeksforgeeks.org/merge-k-sorted-linked-lists/ Round 3: https://www.geeksforgeeks.org/s
1 min read