Microsoft Corporation
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Walk-in and was interviewed in Nov 2021. There were 3 interview rounds.
Top trending discussions
posted on 26 Oct 2020
I applied via Naukri.com and was interviewed in Sep 2020. There were 4 interview rounds.
Data scraping, computer vision, agile methodologies, change request, and testing methods are all important aspects of software engineering.
Data scraping involves extracting data from websites or other sources.
Computer vision involves using algorithms to interpret and analyze visual data.
Agile methodologies are a set of principles for software development that prioritize flexibility and collaboration.
Change requests are...
posted on 30 Nov 2021
I applied via Recruitment Consultant and was interviewed before Nov 2020. There were 3 interview rounds.
Find sum of squares of numbers in list using stream API.
Use mapToInt() to convert list of integers to IntStream
Use map() to square each element of IntStream
Use sum() to get the sum of squares
Searching in 2D sorted array row wise and column wise.
Start from the top right corner or bottom left corner
Compare the target with the current element
Move left or down if target is smaller or move right or up if target is larger
Repeat until target is found or out of bounds
I appeared for an interview in Jul 2019.
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 applied via Campus Placement and was interviewed before Jun 2020. There were 4 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 120minutes
Round difficulty - Easy
It was an online MCQ's + coding round consisting of 20 MCQ’s and 1 coding problem.
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at double the speed of the other.
If there is a loop, the two pointers will eventually meet at the same node.
Example: 1 -> 2 -> 3 -> 4 -> 5 -> 2 (loop back to 2), the two pointers will meet at node 2.
Round duration - 50 minutes
Round difficulty - Easy
The interview started at 8:30 pm in cc of Delhi Technological University itself and it was quite late. There was only a single interviewer and he asked me one coding question related to overflow of integers.
To check for integer overflow when multiplying two integers, use the properties of integer overflow and check if the result is within the valid range of the integer type.
Check if the signs of the two integers are the same to avoid overflow in case of multiplication.
Use the properties of integer overflow to detect if the result exceeds the maximum or minimum value of the integer type.
Consider using a larger data type or...
Round duration - 15 minutes
Round difficulty - Easy
It was quite late . There was only one interviewer and I was asked about my family , education and future plannings and few questions related joining locations and documents etc.
Focus on data structures and algorithms part more. Tell the interviewer , starting from the brute force approach to the most optimal solution as this will give a good impression to the interviewer.
Application resume tips for other job seekersTo be honest, the problem-solving ability is the only thing that most companies care about. So you can manipulate your resume according to that. Mention your competitive programming handles in your resume and also other coding ranks or achievements which you have achieved.
Final outcome of the interviewSelectedI applied via Company Website and was interviewed before Sep 2020. There were 3 interview rounds.
I appeared for an interview in Jan 2021.
Merge sort and Quick sort are sorting algorithms while Fibonacci is a sequence of numbers.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half and then merges them.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot.
Fibonacci is a sequence of numbers where each number is the sum of the two precedin...
I applied via Company Website and was interviewed in Nov 2020. There were 3 interview rounds.
Software Engineer
2.2k
salaries
| ₹15 L/yr - ₹50 L/yr |
Senior Software Engineer
1.2k
salaries
| ₹25 L/yr - ₹95 L/yr |
Software Engineer2
1.1k
salaries
| ₹20.6 L/yr - ₹70 L/yr |
Software Developer
607
salaries
| ₹30 L/yr - ₹54.2 L/yr |
Support Engineer
596
salaries
| ₹9 L/yr - ₹30 L/yr |
Amazon
Deloitte
TCS