Microsoft Corporation
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
2 DSA questions asked on codility platform. One was about backtracking, and another about 1D DP.
Check if any node in binary tree violates left node value less than right node value rule.
Traverse the binary tree using depth-first search (DFS) or breadth-first search (BFS) and check each node for the given condition.
If a node has two children and the left child's value is greater than the right child's value, return false.
If no such node is found, return true.
Example: For a binary tree with nodes 5, 3, 7, 2, 4, 6, ...
Use a hash set to efficiently remove duplicate characters from a string.
Create a hash set to store unique characters.
Iterate through the string and add each character to the hash set.
If a character is already in the hash set, skip it.
Convert the hash set back to a string to get the result.
I applied via Company Website and was interviewed in Aug 2023. There were 3 interview rounds.
Asked from sorting and DP.two qeustions were there
Convert Roman numerals to numbers
Create a mapping of Roman numerals to their corresponding values
Iterate through the Roman numeral string from right to left
If the current numeral is smaller than the next numeral, subtract its value from the total
Otherwise, add its value to the total
Rotate the array in place by k steps
Use the modulus operator to handle cases where k is greater than the array length
Reverse the entire array, then reverse the first k elements and the remaining elements separately
posted on 2 Dec 2024
Data Structures and Algorithm Questions
posted on 2 Apr 2024
I applied via LinkedIn and was interviewed in Mar 2024. There were 3 interview rounds.
2 Questions on Hackerrank, approx. 60 minutes. Not too hard but requires Java knowledge
posted on 1 Oct 2024
I applied via Approached by Company and was interviewed in Apr 2024. There were 2 interview rounds.
Find the maximum variation in a subarray of integers.
Iterate through the array and keep track of the maximum and minimum values seen so far.
Calculate the variation by subtracting the minimum value from the maximum value.
Return the maximum variation found in any subarray.
I was interviewed in Feb 2024.
2 Questions of Leetcode medium difficulty
posted on 9 May 2024
3 SIMPLE DSA questions
DFS and BFS are fundamental graph traversal algorithms used to explore nodes in a graph.
DFS (Depth First Search) explores as far as possible along each branch before backtracking. It uses a stack to keep track of nodes.
BFS (Breadth First Search) explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth. It uses a queue to keep track of nodes.
Example: For a graph with nodes A...
posted on 12 Jun 2024
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
It was easy as compared to traditional questions
posted on 4 Apr 2024
I applied via Company Website and was interviewed in Oct 2023. There was 1 interview round.
Use two heaps to maintain the median in a data stream
Use a max heap to store the smaller half of the numbers and a min heap to store the larger half
Keep the size of the two heaps balanced or differ by at most 1 to find the median efficiently
If the total number of elements is odd, the median is the top element of the max heap. If even, average the tops of both heaps
posted on 20 Mar 2024
I applied via LinkedIn and was interviewed before Mar 2023. There were 2 interview rounds.
Code quality can be measured through various metrics and tools to ensure readability, maintainability, efficiency, and reliability.
Use code review processes to assess adherence to coding standards and best practices
Utilize static code analysis tools to identify potential bugs, code smells, and security vulnerabilities
Measure code complexity using metrics like cyclomatic complexity and maintainability index
Track code co...
2.5 hours of hackerrank test
based on 2 interviews
Interview experience
based on 5 reviews
Rating in categories
Software Engineer
1.9k
salaries
| ₹13 L/yr - ₹50 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹25 L/yr - ₹85 L/yr |
Software Engineer2
1k
salaries
| ₹20 L/yr - ₹70 L/yr |
Consultant
599
salaries
| ₹13 L/yr - ₹36.7 L/yr |
Support Engineer
578
salaries
| ₹7.7 L/yr - ₹30 L/yr |
Amazon
Deloitte
TCS