Filter interviews by
I am a dedicated Technical Support Engineer with 5 years of experience in troubleshooting hardware and software issues.
5 years of experience in technical support
Proficient in troubleshooting hardware and software issues
Strong communication and problem-solving skills
Certified in IT support
Experience working with various operating systems such as Windows and Linux
Day to day activities of a Technical Support Engineer involve troubleshooting technical issues, providing customer support, and documenting solutions.
Troubleshooting technical issues reported by customers
Providing customer support via phone, email, or chat
Documenting solutions and creating knowledge base articles
Collaborating with other teams to resolve complex issues
Testing software updates and patches before deployme
2 DSA questions asked on codility platform. One was about backtracking, and another about 1D DP.
Check if any node in binary tree violates left node value less than right node value rule.
Traverse the binary tree using depth-first search (DFS) or breadth-first search (BFS) and check each node for the given condition.
If a node has two children and the left child's value is greater than the right child's value, return false.
If no such node is found, return true.
Example: For a binary tree with nodes 5, 3, 7, 2, 4, 6, ...
Use a hash set to efficiently remove duplicate characters from a string.
Create a hash set to store unique characters.
Iterate through the string and add each character to the hash set.
If a character is already in the hash set, skip it.
Convert the hash set back to a string to get the result.
Sort the array in alternates
Iterate through the array and separate the strings into two separate arrays based on their index being even or odd
Sort both arrays separately
Merge the two sorted arrays back into the original array in alternate positions
What people are saying about Microsoft Corporation
6 questions asked in an interview
The slider window problem involves finding the maximum sum of a subarray of a fixed size k within an array of integers.
Use a sliding window approach to efficiently find the maximum sum subarray.
Keep track of the current sum within the window and update it as you slide the window.
Maintain a variable to store the maximum sum found so far.
Example: Given array [1, 3, -1, -3, 5, 3, 6, 7] and window size k=3, the maximum sum
The stock buy sell problem involves finding the maximum profit that can be made by buying and selling a stock at the right times.
Calculate the difference between each pair of consecutive prices in the array
Find the maximum subarray sum of the differences using Kadane's algorithm
The maximum subarray sum is the maximum profit that can be made
Microsoft Corporation interview questions for popular designations
DSA, Graph, DP, Arrays
Get interview-ready with Top Microsoft Corporation Interview Questions
Rust provides various synchronisation primitives like Mutex, RwLock, Atomic types, etc.
Mutex: Provides exclusive access to data
RwLock: Allows multiple readers or one writer at a time
Atomic types: Provide atomic operations on primitive types
Rust code to read a file, reverse contents, and write back using multiple threads
Use std::fs to read and write files
Create multiple threads to handle reading, reversing, and writing operations
Use channels to communicate between threads
DSA question on Depth first search. & other on reverse the strings.
Architecture roadmap 3 tier
The culture of the firm is collaborative, innovative, and customer-focused.
Encourages teamwork and open communication
Values creativity and continuous improvement
Prioritizes customer satisfaction
Promotes diversity and inclusion
Emphasizes work-life balance
I applied via Approached by Company and was interviewed in Jul 2024. There were 2 interview rounds.
Longest continuous subarray with absolute difference less than or equal to limit
DP AND GRAPH related questions they asked
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 374 interviews
Interview experience
based on 1.7k reviews
Rating in categories
Software Engineer
2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
599
salaries
| ₹0 L/yr - ₹0 L/yr |
Support Engineer
552
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Deloitte
TCS