Filter interviews by
I applied via Referral and was interviewed in Jun 2024. There were 3 interview rounds.
Online coding test of 45 mins
BFS and DFS are algorithms for traversing or searching tree or graph data structures.
BFS (Breadth-First Search) explores neighbors level by level, using a queue.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking, using a stack.
Example of BFS: Finding the shortest path in an unweighted graph.
Example of DFS: Checking for cycles in a graph.
Inverted array problem involves reversing the order of elements in an array of strings.
Iterate through the array from both ends and swap the elements until reaching the middle.
Use a temporary variable to store the element being swapped.
Example: Input array ['apple', 'banana', 'cherry'] should be inverted to ['cherry', 'banana', 'apple'].
LLD design of order collection service involves designing the detailed architecture of the service for collecting orders.
Define the components of the order collection service such as order processing, validation, storage, and retrieval.
Design the data flow between these components and how they interact with each other.
Consider scalability, fault tolerance, and performance optimization in the design.
Use appropriate desi...
Two arrays represented as trees are identical if they have the same structure and values at each node.
Check if the arrays have the same length.
Compare the root nodes of both trees.
Recursively compare the left and right subtrees of both trees.
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
Easy to medium level dsa questions
I appeared for an interview before Jul 2024, where I was asked the following questions.
Validate continuous subarray sum and return indices of matching subarrays.
Use a hashmap to store cumulative sums and their indices.
Iterate through the array, calculating the cumulative sum.
Check if the cumulative sum minus the target exists in the hashmap.
If found, record the starting and ending indices of the subarray.
Example: For array [1, 2, 3, 4] and target 5, subarray [2, 3] matches.
Implementing a generic timer and a Tic Tac Toe game using object-oriented principles.
1. Timer Class: Create a Timer class with methods to start, stop, and reset the timer.
2. Timer Locations: Use a dictionary to manage multiple timers for different locations.
3. Tic Tac Toe Class: Create a TicTacToe class with methods for player moves, checking win conditions, and displaying the board.
4. Game Loop: Implement a loop to al...
I applied via Campus Placement and was interviewed before Jul 2023. There was 1 interview round.
Dsa based questions. On trees and arrays.
What people are saying about Microsoft Corporation
They asked me to create a live working project and sufficient time was provided.
I applied via Company Website and was interviewed before Jul 2021. There were 2 interview rounds.
Data Structure related questions
I applied via LinkedIn and was interviewed before Apr 2021. There were 2 interview rounds.
It was quite good
Assignment was real world based
I applied via Recruitment Consultant and was interviewed before Feb 2020. There were 3 interview rounds.
I appeared for an interview before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Given a string STR and a non-empty string PTR, identify all the starting indices of anagrams of PTR within STR.
An anagram of a string is another string ...
Given a string STR and a non-empty string PTR, find all starting indices of anagrams of PTR within STR.
Create a frequency map of characters in PTR.
Use sliding window technique to check anagrams in STR.
Return the starting indices of anagrams found.
Given an array of integers, find the sum of all subsets in non-decreasing order of the given array.
N = 3, array = [1, 2]
[0, 1, 2, 3]
Find sum of all subsets in non-decreasing order of given array.
Use recursion to generate all subsets of the array
Calculate sum of each subset and store in a list
Sort the list in non-decreasing order to get the final result
Round duration - 60 minutes
Round difficulty - Medium
First he asked me to tell about myself, then he asked me some OOPS Concepts,difference in shallow copy and deep copy,
asked me to write a code for boundary traversal of binary tree.
Given a binary tree consisting of integers, your task is to provide the boundary nodes of this tree in an anti-clockwise direction, starting with the ro...
Boundary traversal of a binary tree to find left boundary, right boundary, and leaf nodes in an anti-clockwise direction.
Perform a pre-order traversal to get the left boundary nodes
Perform an in-order traversal to get the leaf nodes
Perform a post-order traversal to get the right boundary nodes
Combine the results to get the boundary nodes in anti-clockwise direction
Round duration - 60 minutes
Round difficulty - Easy
The second tech interview lasted for about an hour and half. First he asked me to tell about myself. Then he asked me how my first interview was. He then asked me where should I start, data structures, databases, to which I replied anywhere.
He started asking questions about C. He asked difference between call by pointer and call by reference. Whether a function can be defined as
void function(int &x, int &y);
Then he asked what is volatile data type in C. Then about the static data class.
He also asked me to write a program to find length of a string.
Then he asked about how functions in C work. How does the program know where to go back after a function is over, etc.
He then asked me if I knew C++, I said no. So he continued to ask a few questions on data structures.
He then asked about the ACID properties which a good database must have. He asked how are transactions managed by a database, what are commits, how, in case of a power failure, data is reverted back, etc.
Then he asked me whether I like to work individually or in a team. I said in a team. He then gave me scenario where I have to decide between a project I am working on, whose deadline is approaching, and helping a friend working on another project whose deadline is also approaching, and asked me what would I do in such a case.
This problem requires you to return a pointer that references the middle node of a singly linked list.
If the number of elements in the linked list is odd, ...
Return the middle node of a singly linked list, considering odd and even number of elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the node pointed to by the slow pointer as the middle node
Tip 1 : Practice at least 5 codes daily.
Tip 2 : Do at-least one machine Learning Project.
Tip 1 : Have at least three project.
Tip 2 : Put some achievements.
I applied via LinkedIn and was interviewed before Jun 2021. There was 1 interview round.
My favorite Google product is Google Maps, and I would enhance its offline capabilities and user-generated content features.
Improve offline map functionality by allowing users to download larger areas for navigation.
Integrate augmented reality features for better navigation in complex environments, like malls or airports.
Enhance user-generated content by implementing a reward system for accurate reviews and updates.
Int...
Some of the top questions asked at the Microsoft Corporation Software Developer II interview -
based on 4 interview experiences
Difficulty level
Duration
based on 3 reviews
Rating in categories
Software Engineer
2.6k
salaries
| ₹24.9 L/yr - ₹44 L/yr |
Senior Software Engineer
1.5k
salaries
| ₹36.7 L/yr - ₹75.9 L/yr |
Software Engineer2
1.3k
salaries
| ₹33.2 L/yr - ₹60 L/yr |
Software Developer
1.2k
salaries
| ₹26 L/yr - ₹46.1 L/yr |
Consultant
606
salaries
| ₹19.9 L/yr - ₹35 L/yr |
Amazon
Deloitte
TCS