Microsoft Corporation
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Traverse through 2D array consisting of 0s and 1s. 1 -> Infected and 0-> non-infected. Find the time needed to make entire array affected.
Brute-Force and BFS/DFS approach
Create System design for image storage and retrieval process with cache and DB error handling approach
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.
posted on 31 Mar 2022
I applied via Naukri.com and was interviewed before Mar 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Jun 2020. There were 5 interview rounds.
I appeared for an interview before Jan 2021.
Round duration - 120 Minutes
Round difficulty - Medium
The test included MCQ questions from SQL, Linux Commands, C/C++ programming, Logical Reasoning, Aptitude
questions. The other section was the coding round, where 2 SQL queries and 2 coding questions were there.
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.
The first lin...
Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.
Iterate through all possible triplets of numbers in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of any three numbers is equal to the square of another number.
Return 'y...
Given a string STR
consisting of lowercase English letters, identify the first non-repeating character in the string and return it. If no such characte...
Identify the first non-repeating character in a string and return it, or '#' if none exists.
Iterate through the string to count the frequency of each character
Iterate through the string again to find the first character with frequency 1
Return the first non-repeating character or '#' if none exists
Round duration - 70 Minutes
Round difficulty - Medium
This was a standard DSA round where I was asked to solve 2 questions and also code it in a production ready manner . After DS and Algo , I was asked some questions from OOPS and Java followed by some Unix Commands and basic concepts from Operating Systems.
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store duplicates.
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers - prev, current, and next to reverse the linked list in O(N) time and O(1) space complexity.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Serialization is the process of converting an object into a byte stream, while deserialization is the reverse process.
Serialization is used to persist object state or transmit objects over a network.
Deserialization reconstructs the object from the byte stream.
Java provides Serializable interface for serialization and ObjectInputStream/ObjectOutputStream classes for deserialization.
Example: Serializing an object to a fi
Singleton class in Java ensures that a class has only one instance and provides a global point of access to it.
Singleton class restricts the instantiation of a class to one object.
It provides a way to access its unique instance globally.
Commonly implemented using a private constructor and a static method to return the instance.
Example: Logger class in a multi-threaded application.
Piping in Unix/Linux allows the output of one command to be used as the input for another command.
Piping is done using the | symbol
It helps in connecting multiple commands together to perform complex operations
Example: ls -l | grep .txt - This command lists all files in long format and then filters out only the .txt files
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions .
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Rotational shifts refer to working in different shifts at different times. Web service flow is the sequence of steps involved in a web service request. Checking ports on Unix or Solaris machine involves using the netstat command.
Rotational shifts involve working in different shifts at different times, such as day shift, night shift, and swing shift.
Web service flow involves a sequence of steps, such as sending a reques...
I appeared for an interview in Jul 2019.
I applied via Campus Placement
I applied via Referral
Some of the top questions asked at the Microsoft Corporation Senior Software Developer interview -
based on 2 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