Open In App

Microsoft Interview Experience | 4 Years Experienced

Last Updated : 30 Jun, 2021
Improve
Improve
Like Article
Like
Save
Share
Report

Online Coding Round:

  1. N factories are producing pollution. Given pollution amount in terms of integers. Count mini. no. of filters required to reduce total pollution by atleast half. One filter reduces pollution by half.

    Solved using priority queue

  2. There are N cars, each having some of M features. A car feature list is given as binary string. for ex: 0000111, 0 means feature not supported.

    Two cars are similar if their feature description differs by atmost one feature. for ex: 11001, 11000 are similar for every car, find count of similar cars.

    Solved with XOR operator

Face to face interviews scheduled after 1 week

Coding Round: (~40 mins)

  1. https://www.geeksforgeeks.org/search-in-an-array-of-strings-where-non-empty-strings-are-sorted/
  2. Similar to problem: https://www.geeksforgeeks.org/anagram-substring-search-search-permutations/

    In my case, interviewer mentioned that freq. of characters is not considered for anagrams.

    Ex: str1:aabb str2:aaaa  it should return true

Coding and Design Round: 1 hr

  1. Given an image in form of 2-D pixels. Write module to rotate image clockwise and anticlockwise.

    Also tell test cases for testing code

Design Round: 1 hr

  1. Design chess Game
  2. Design Gallery App for features like scrolling, opening image by clicking thumbnail

Hiring Manager Round: (~1 hr)

  1. Work done during professional experience and Technologies
  2. Why looking for change
  3. What kind of work you want to do
  4. What will you bring on the table if we hire you
  5. Given expression in infix notation. Evaluate that. for ex: 12*21 – 323/21 + 3

Solved using 2 stacks

Got Selected.


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 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 (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] https://www.geeksforgeeks.org/random-number-generator-in-arbitrary-probability-distribution-fashion/ 4 outputs when called 4 times =a, a, b, c. Create a fu
1 min read
Microsoft Interview Experience for Software Engineer-2 | 3+ years experienced
Round 1: https://www.geeksforgeeks.org/find-the-largest-subtree-in-a-tree-that-is-also-a-bst/ https://www.geeksforgeeks.org/how-to-print-maximum-number-of-a-using-given-four-keys/ Round 2: https://www.geeksforgeeks.org/external-sorting/ Round 3: https://www.geeksforgeeks.org/select-a-random-node-from-a-singly-linked-list/ Round 4: https://leetcode.
1 min read
Microsoft Interview Experience for Hyderabad Office Team(2 years Experienced)
Round 1:  Find all the missing numbers from an array of size N whose elements belong to the range [0, N]. https://www.geeksforgeeks.org/find-the-smallest-positive-number-missing-from-an-unsorted-array-set-2/ 2. Check whether the given linked list forms a palindrome. https://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindro
2 min read
Microsoft Interview Experience (2-3 years Experienced)
Round 1:  I received a call from one of the recruitment firms 1 week before the interviews which were held in  Microsoft Noida Office. The first round was a written round where we were given 2 coding questions and time given was 45 mins.We had to write code on paper. 1.) Given start and end times of people visiting a park find the maximum number of
4 min read
Microsoft Interview Experience | Senior Software Engineer (4 Years Experienced)
I recently interviewed with MS Hyderabad for Core Services Engineering team. Please find the questions asked below - Round 1 - Two tables employee (contains name and Id) and employee details having work experience history (contains Id, fromYear, toYear) - find out all the employees who worked w/o career break. Java implementation for the same. From
2 min read
Microsoft Interview Experience ( 4+ years Experienced)
There were 3 rounds of interview in total 2 technical (DS/ALGO) and 1 hiring manager round Round 1 (Technical round):1) Level order traversal of Binary Tree 2) Modified question on Knapsack problem Round 2 (Technical round):1) External Sorting 2) Design API rate Limiter Round 3 (Hiring manager round) First, there was in-depth discussion on your cur
1 min read
Microsoft Interview Experience (3+ Years Experienced)
Round 1: Delete Nth node from the end of the given linked list. I gave the straight forward solution and tested it in codility. Traverse first to get the length of the Linked list, and then traverse again to reach the n-k th element that needs to be removed. He asked for a better solution. Even though I could not come up with it, he only explained
3 min read