Microsoft Corporation
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I appeared for an interview in Jun 2024.
Use binary search to find the minimum distance to escape aggressive cows in a field.
Implement a function to check if cows can be placed with a minimum distance in a field.
Use binary search to find the minimum distance that satisfies the condition.
Keep track of the maximum distance found so far while performing binary search.
Find two numbers in an array that add up to a target sum.
Use a hash map to store the difference between the target sum and each element.
Iterate through the array and check if the current element's complement exists in the hash map.
Return the indices of the two numbers that add up to the target sum.
Design a REST API for a software engineer interview
Define the resources and endpoints
Use HTTP methods for CRUD operations (GET, POST, PUT, DELETE)
Implement authentication and authorization
Use JSON for data exchange format
Include error handling and status codes
2 DSA qns on codility
Graphs are data structures that consist of nodes and edges connecting them.
Graphs can be directed or undirected.
Common graph traversal algorithms include BFS and DFS.
Examples of graphs include social networks, road networks, and computer networks.
PRACTISE CODING properly..........
Implementing stack using linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer
Implement push() method to add element to top of stack
Implement pop() method to remove element from top of stack
Implement peek() method to return top element without removing it
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Elements are added with a priority level and retrieved in order of priority
Can be implemented using a heap data structure
Operations include insert, delete, and peek
Can be used in algorithms such as Dijkstra's shortest path algorithm
Microsoft Corporation interview questions for designations
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
Heavy Dsa was found minimum leetcode hard
Get interview-ready with Top Microsoft Corporation Interview Questions
I applied via Campus Placement
Print all downward paths from any node in a binary tree with sum of elements equal to N.
Traverse the binary tree and keep track of the sum of elements in the path from root to current node.
If the sum equals N, print the path from root to current node.
Recursively traverse the left and right subtrees with updated sum.
Use a stack to keep track of the current path being traversed.
Example: Binary tree with root 1, left chil...
Yes, it is possible to get the accurate result from the given data.
The coordinates (i,j,k) where metallic balls are present can be determined by finding the set elements in both matrix1 and matrix2.
Additional data is not required as the given data is sufficient to determine the coordinates.
The coordinates can be obtained by iterating through the elements of matrix1 and matrix2 and checking for set elements.
Backend server code for a tic tac toe game
Create a RESTful API using a framework like Express.js
Implement game logic to check for winning conditions
Use a database to store game state and user information
Handle user authentication and authorization
Implement real-time updates using WebSockets
Program to store and reconstruct a tree from a file with efficient techniques.
Use a recursive approach to traverse the tree and write each node to the file
Include information about the node's parent and children in the file
Use a unique identifier for each node to reconstruct the tree from the file
Use a data structure like a hash table to store the nodes and their identifiers for efficient reconstruction
I applied via Campus Placement
To find n-k th element from last in a string of unknown length
Traverse the string to find its length
Calculate the position of n-k th element from last
Traverse the string again to find the element at calculated position
Count the number of unique occurrences in an array of strings.
Create a hash table to store the count of each string occurrence.
Iterate through the array and update the count in the hash table.
Count the number of unique occurrences by counting the number of keys in the hash table.
I appeared for an interview in Jul 2019.
I applied via Referral
Some of the top questions asked at the Microsoft Corporation Software Engineer interview for freshers -
The duration of Microsoft Corporation Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 3 interviews
2 Interview rounds
based on 143 reviews
Rating in categories
Software Engineer
2.2k
salaries
| ₹15 L/yr - ₹51 L/yr |
Senior Software Engineer
1.2k
salaries
| ₹25 L/yr - ₹95 L/yr |
Software Engineer2
1.1k
salaries
| ₹21.1 L/yr - ₹72 L/yr |
Software Developer
880
salaries
| ₹14.3 L/yr - ₹51 L/yr |
Support Engineer
601
salaries
| ₹9 L/yr - ₹30 L/yr |
Amazon
Deloitte
TCS