Microsoft Corporation
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I appeared for an interview in Dec 2016.
I had a 6-month internship at XYZ Company where I worked on developing a web application using Java and Angular.
Developed a web application using Java and Angular
Collaborated with a team of developers to design and implement new features
Participated in code reviews and debugging sessions
Gained experience in Agile development methodologies
Developed a web-based inventory management system for a retail company.
Used Java and Spring framework to build the backend
Implemented a responsive user interface using HTML, CSS, and JavaScript
Integrated with a barcode scanner for efficient product tracking
Implemented role-based access control for different user roles
Optimized database queries for improved performance
The question asks to find the similarity between two words by developing our own sense of similarity.
Normalize the length of the Longest Common Subsequence (LCS) by dividing it by the total length of the string.
Implement a function that calculates the LCS between two words.
Divide the length of the LCS by the sum of the lengths of the two words.
Return the normalized similarity score as the result.
The function returns a doubly linked list of all the nodes at each level of a given binary tree.
Use a breadth-first search (BFS) algorithm to traverse the binary tree level by level.
Create a doubly linked list for each level and append the nodes to it.
Connect the doubly linked lists of each level to form the final result.
Yes, I thrive in high-pressure situations and have a proven track record of delivering quality work under tight deadlines.
I have successfully completed multiple projects on tight deadlines
I am able to prioritize tasks effectively to meet deadlines
I remain calm and focused under pressure to ensure quality work is delivered
I have achieved significant milestones in my career as a Senior Software Developer.
Developed and implemented a scalable and efficient software solution for a large e-commerce platform, resulting in a 30% increase in sales.
Led a team of developers to successfully deliver a complex project within a tight deadline, earning recognition from the client.
Optimized the performance of a critical software module, reducing its ex...
I can bring extensive experience in software development, strong problem-solving skills, and a proven track record of delivering high-quality solutions.
Extensive experience in software development
Strong problem-solving skills
Proven track record of delivering high-quality solutions
Yes, I am committed to delivering my 100% in the job.
I am dedicated to producing high-quality code and meeting project deadlines.
I continuously strive to improve my skills and stay updated with the latest technologies.
I have a track record of successfully completing projects and exceeding expectations.
I appeared for an interview in Dec 2016.
I completed a software development internship at a tech startup.
Developed a web application using React.js and Node.js
Worked on optimizing database queries for improved performance
Collaborated with a team of developers to troubleshoot and debug code
Participated in daily stand-up meetings to discuss progress and roadblocks
Developed a web application for online shopping
Used HTML, CSS, and JavaScript for front-end development
Implemented backend using Node.js and MongoDB for database management
Integrated payment gateway for secure transactions
Implemented user authentication and authorization features
The question asks to find the similarity between two words by normalizing the length of the longest common subsequence (LCS) by the total length of the string.
Implement a function that takes two words as input
Find the length of the longest common subsequence (LCS) between the two words
Normalize the length of LCS by dividing it by the total length of the string
Return the normalized similarity value
The function takes a binary tree as input and returns a doubly linked list of all the nodes at each level.
Use a breadth-first search (BFS) algorithm to traverse the binary tree level by level.
For each level, create a doubly linked list and add the nodes to it.
Connect the doubly linked lists of each level to form the final result.
Yes, I can work well under pressure by staying organized, prioritizing tasks, and maintaining a positive attitude.
I have experience working on tight deadlines and delivering high-quality results.
I am able to stay calm and focused in stressful situations.
I prioritize tasks effectively to ensure that all deadlines are met.
I communicate effectively with team members to manage workload and expectations.
I maintain a positiv...
Led a team to successfully launch a new mobile app, resulting in a 50% increase in user engagement.
Led a team to develop and launch a new mobile app
Achieved a 50% increase in user engagement
Implemented new features based on user feedback
Collaborated with cross-functional teams to ensure project success
I can contribute my strong technical skills, problem-solving abilities, and passion for software development to drive innovation and success for the company.
I have a solid foundation in software development principles and practices
I excel at problem-solving and troubleshooting complex technical issues
I am passionate about staying up-to-date with the latest technologies and trends in the industry
Yes, I am committed to giving my 100% in the job.
I am dedicated to meeting deadlines and exceeding expectations.
I have a strong work ethic and take pride in my work.
I am always looking for ways to improve and learn new skills.
I have a track record of delivering high-quality results in my previous roles.
I appeared for an interview in Apr 2017.
String compression algorithm to reduce the size of a string by replacing repeated characters with a count.
Iterate through the string and count the number of consecutive occurrences of each character.
Append the character and its count to a new string.
If the compressed string is longer than the original string, return the original string.
Example: 'aabcccccaaa' -> 'a2b1c5a3'
What people are saying about Microsoft Corporation
I applied via Campus Placement and was interviewed in Jan 2016. There were 5 interview rounds.
To find a loop in a directed graph, use Floyd's cycle-finding algorithm. To find the last element in a binary tree, traverse the tree and return the rightmost leaf node.
For finding a loop in a directed graph, use Floyd's cycle-finding algorithm which uses two pointers moving at different speeds.
To find the last element in a binary tree, traverse the tree recursively or iteratively and return the rightmost leaf node.
The question is about finding the last number in a circular queue that has the highest number of digits.
Implement a circular queue data structure
Iterate through the circular queue to find the last number with the highest number of digits
Compare the number of digits of each number in the circular queue
Keep track of the last number with the highest number of digits
Microsoft Corporation interview questions for popular designations
I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.
Get interview-ready with Top Microsoft Corporation Interview Questions
I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There was 1 interview round.
Check if left child is less than right child in a binary tree
Traverse the tree recursively and compare left and right child values
Use a stack to traverse the tree iteratively and compare left and right child values
Return true if all left children are less than right children, else false
Use built-in string method to check substring presence for faster execution.
Use 'indexOf' method to check if substring is present in the main string.
If the method returns -1, the substring is not present.
If the method returns a non-negative integer, the substring is present.
I appeared for an interview before Feb 2016.
The question asks to determine the similarity between two words.
Use a similarity metric like Levenshtein distance or cosine similarity
Normalize the words by converting them to lowercase and removing punctuation
Consider using a pre-trained word embedding model for semantic similarity
Implement a function that calculates the similarity score between two words
I applied via Campus Placement
I applied via Campus Placement
To test if every left child's value is less than the right child's value in a binary tree.
Traverse the binary tree using any traversal algorithm (e.g., in-order, pre-order, post-order)
Compare the value of each left child with its right child
If any left child's value is greater than or equal to its right child's value, return false
If all left child's values are less than their right child's values, return true
Cloning a linked list-like structure
Create a new node for each node in the original linked list
Set the value of the new node to the value of the corresponding node in the original linked list
Set the next pointer of the new node to the new node corresponding to the next node in the original linked list
Repeat the above steps until all nodes in the original linked list are cloned
To find the nth character in a stream of bytes, we need to read the stream byte by byte until we reach the nth position.
Start reading the stream byte by byte until you reach the nth position
Return the byte at the nth position
If the stream ends before reaching the nth position, return null or throw an exception
Rearrange a string to avoid consecutive same characters.
Iterate through the string and keep track of the previous character.
If the current character is the same as the previous, swap it with the next different character.
Repeat until no consecutive same characters are left.
The task is to find the next highest palindrome number given a number.
Convert the given number to a string
Check if the number is already a palindrome
If not, increment the number by 1 and check if it is a palindrome
Repeat the previous step until a palindrome is found
Canonicalizing a directory path involves simplifying and standardizing the path to remove any redundant or unnecessary elements.
Remove any consecutive slashes and replace them with a single slash
Remove any trailing slashes
Resolve any relative paths (e.g., '..' and '.')
Handle special cases like the root directory ('/')
Normalize the path by removing any unnecessary elements
Some of the top questions asked at the Microsoft Corporation interview -
The duration of Microsoft Corporation interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 375 interviews
Interview experience
based on 1.7k reviews
Rating in categories
Software Engineer
1.6k
salaries
| ₹16 L/yr - ₹50 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹25 L/yr - ₹96 L/yr |
Software Engineer2
1k
salaries
| ₹20 L/yr - ₹72 L/yr |
Software Developer
762
salaries
| ₹14 L/yr - ₹50.4 L/yr |
Consultant
600
salaries
| ₹13 L/yr - ₹36.7 L/yr |
Amazon
Deloitte
TCS