Filter interviews by
Find the kth largest element in an array of integers using efficient algorithms.
Use a max-heap to extract the largest elements efficiently. Example: For array [3, 2, 1, 5, 6, 4] and k=2, return 5.
Alternatively, use quickselect algorithm for average O(n) time complexity. Example: In the same array, quickselect can find the 2nd largest.
Sorting the array and accessing the kth largest directly is simple but O(n log n)...
Count distinct islands in a grid of '1's (land) and '0's (water) using DFS or BFS.
Use Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the grid.
Mark visited land cells to avoid counting them multiple times.
Each time you start a new DFS/BFS from an unvisited land cell, increment the island count.
Example: For grid [['1', '1', '0'], ['0', '1', '0'], ['0', '0', '1']], there are 2 islands.
I want to join Microsoft to contribute to innovative projects, grow my skills, and be part of a diverse and impactful team.
Microsoft's commitment to innovation aligns with my passion for cutting-edge technology, like AI and cloud computing.
The opportunity to work on products that impact millions, such as Azure and Office 365, excites me.
I admire Microsoft's focus on diversity and inclusion, fostering a collaborati...
My long-term goal is to become a lead software architect, driving innovative solutions and mentoring future developers.
Aim to deepen my expertise in software design patterns and architecture principles.
Aspire to lead a team of developers on large-scale projects, like building a cloud-based application.
Plan to contribute to open-source projects to enhance my skills and give back to the community.
Seek opportunities ...
What people are saying about Microsoft Corporation
A graph is a data structure that consists of nodes (vertices) connected by edges.
Nodes represent entities and edges represent relationships between entities
Graphs can be directed or undirected
Common graph algorithms include depth-first search and breadth-first search
Optimizing code for reduced time complexity by using efficient algorithms and data structures.
Use efficient data structures like hash tables, binary search trees, or priority queues.
Avoid nested loops and try to reduce the number of iterations.
Utilize dynamic programming or memoization to store and reuse intermediate results.
Consider using bitwise operations for certain calculations.
Optimize recursive functions by...
A logger captures and stores application events for debugging and monitoring purposes.
Log Levels: Define levels like DEBUG, INFO, WARN, ERROR, and FATAL for categorizing logs.
Output Formats: Support multiple formats (e.g., JSON, plain text) for flexibility.
Log Rotation: Implement log rotation to manage file sizes and prevent disk overflow.
Asynchronous Logging: Use asynchronous methods to avoid blocking application...
C language was developed in 1972.
Developed by Dennis Ritchie at Bell Labs.
First appeared in 1972.
Influential in the development of many other programming languages like C++, Java, and Python.
printf() is used to print formatted output to the screen, while scanf() is used to read formatted input from the user.
printf() is used to display output on the screen in a formatted way.
scanf() is used to read input from the user in a formatted way.
Example: printf("Hello, World!"); will display 'Hello, World!' on the screen.
Example: scanf("%d", &num); will read an integer input from the user and store it in 'num'.
The founder of C language is Dennis Ritchie.
Dennis Ritchie is the creator of the C programming language.
He developed C language at Bell Labs in the early 1970s.
C language is widely used for system programming and developing other programming languages.
LeetCode , hard questions on dynamic programming, graphs, and more.
DSA, Cn, os, DBMS, ML
I applied via LinkedIn and was interviewed in Jul 2024. There were 3 interview rounds.
It was bsed on DP, Trees and Graphs
Optimizing code for reduced time complexity by using efficient algorithms and data structures.
Use efficient data structures like hash tables, binary search trees, or priority queues.
Avoid nested loops and try to reduce the number of iterations.
Utilize dynamic programming or memoization to store and reuse intermediate results.
Consider using bitwise operations for certain calculations.
Optimize recursive functions by elim...
I appeared for an interview in Feb 2025, where I was asked the following questions.
DSA, Graph, DP, Arrays
I applied via Referral and was interviewed in Apr 2024. There were 4 interview rounds.
OA Test with 2 medium level questions
Find the kth largest element in an array of integers using efficient algorithms.
Use a max-heap to extract the largest elements efficiently. Example: For array [3, 2, 1, 5, 6, 4] and k=2, return 5.
Alternatively, use quickselect algorithm for average O(n) time complexity. Example: In the same array, quickselect can find the 2nd largest.
Sorting the array and accessing the kth largest directly is simple but O(n log n). Exa...
Count distinct islands in a grid of '1's (land) and '0's (water) using DFS or BFS.
Use Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the grid.
Mark visited land cells to avoid counting them multiple times.
Each time you start a new DFS/BFS from an unvisited land cell, increment the island count.
Example: For grid [['1', '1', '0'], ['0', '1', '0'], ['0', '0', '1']], there are 2 islands.
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
2 problem related to graphs and dynamic programming 45min I was given to solve I was able to solve both of them and got shortlisted for the next round.
I have a strong technical background, excellent problem-solving skills, and a passion for software development.
I have a Bachelor's degree in Computer Science and 5 years of experience in software development.
I have successfully completed multiple projects using various programming languages such as Java, Python, and JavaScript.
I am a quick learner and always eager to expand my knowledge and skills in the field of softw...
I applied via Campus Placement and was interviewed in Aug 2024. There was 1 interview round.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
1 hr wide varitey of question
A graph is a data structure that consists of nodes (vertices) connected by edges.
Nodes represent entities and edges represent relationships between entities
Graphs can be directed or undirected
Common graph algorithms include depth-first search and breadth-first search
2 easy level machine coding round.
A logger captures and stores application events for debugging and monitoring purposes.
Log Levels: Define levels like DEBUG, INFO, WARN, ERROR, and FATAL for categorizing logs.
Output Formats: Support multiple formats (e.g., JSON, plain text) for flexibility.
Log Rotation: Implement log rotation to manage file sizes and prevent disk overflow.
Asynchronous Logging: Use asynchronous methods to avoid blocking application perf...
Some of the top questions asked at the Microsoft Corporation Software Developer interview -
The duration of Microsoft Corporation Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 30 interview experiences
Difficulty level
Duration
based on 92 reviews
Rating in categories
Software Engineer
2.5k
salaries
| ₹24.9 L/yr - ₹44.2 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹34.8 L/yr - ₹73.5 L/yr |
Software Engineer2
1.2k
salaries
| ₹33 L/yr - ₹60 L/yr |
Software Developer
1.1k
salaries
| ₹24.7 L/yr - ₹45.3 L/yr |
Support Engineer
607
salaries
| ₹14.4 L/yr - ₹24.5 L/yr |
Amazon
Deloitte
TCS