Filter interviews by
Facebook's database design focuses on scalability, user relationships, and efficient data retrieval.
User Profiles: Each user has a unique profile containing personal information, posts, and friend connections.
Social Graph: A graph database structure to represent relationships between users, allowing for efficient querying of friends and connections.
Posts and Interactions: Tables for storing posts, likes, comments,...
Design a data structure to efficiently manage and delete expired web pages without references.
Use a hash table to store active pages with their URLs as keys for quick access.
Implement a linked list to maintain the order of pages for easy deletion of expired pages.
Utilize a timestamp to track the last access time of each page, allowing for easy identification of expired pages.
Consider a garbage collection mechanism...
Design an algorithm for a mobile contact search application that enhances user experience and efficiency.
Utilize a trie data structure for efficient prefix searching of contact names.
Implement fuzzy search to handle typos or partial matches, e.g., searching 'Jon' returns 'John'.
Incorporate filters for sorting results by frequency of contact usage or recent interactions.
Allow voice search functionality for hands-fr...
Insert a node at its correct position in a circular linked list containing sorted elements.
Traverse the linked list until the correct position is found
Handle the case where the value to be inserted is smaller than the smallest element or larger than the largest element
Update the pointers of the neighboring nodes to insert the new node
Consider the case where the linked list has only one node
What people are saying about Microsoft Corporation
Given a 2D array of alphabets and a function to check valid English words, find all possible valid words adjacent to each other.
Create a recursive function to traverse the 2D array and check for valid words
Use memoization to avoid redundant checks
Consider edge cases such as words with repeating letters
Optimize the algorithm for time and space complexity
McDonald's order system involves structured data flow from order placement to delivery, ensuring efficiency and accuracy.
1. Customer places an order using a digital kiosk or cashier, which captures order details in a structured format (e.g., JSON).
2. The order is sent to the kitchen display system (KDS), where it is displayed for kitchen staff to prepare.
3. The KDS organizes orders based on priority and preparatio...
Facebook's database design focuses on scalability, user relationships, and efficient data retrieval.
User Profiles: Each user has a unique profile containing personal information, posts, and friend connections.
Social Graph: A graph database structure to represent relationships between users, allowing for efficient querying of friends and connections.
Posts and Interactions: Tables for storing posts, likes, comments, and ...
Design a data structure to efficiently manage and delete expired web pages without references.
Use a hash table to store active pages with their URLs as keys for quick access.
Implement a linked list to maintain the order of pages for easy deletion of expired pages.
Utilize a timestamp to track the last access time of each page, allowing for easy identification of expired pages.
Consider a garbage collection mechanism that...
Design an algorithm for a mobile contact search application that enhances user experience and efficiency.
Utilize a trie data structure for efficient prefix searching of contact names.
Implement fuzzy search to handle typos or partial matches, e.g., searching 'Jon' returns 'John'.
Incorporate filters for sorting results by frequency of contact usage or recent interactions.
Allow voice search functionality for hands-free ac...
Given a 2D array of alphabets and a function to check valid English words, find all possible valid words adjacent to each other.
Create a recursive function to traverse the 2D array and check for valid words
Use memoization to avoid redundant checks
Consider edge cases such as words with repeating letters
Optimize the algorithm for time and space complexity
Insert a node at its correct position in a circular linked list containing sorted elements.
Traverse the linked list until the correct position is found
Handle the case where the value to be inserted is smaller than the smallest element or larger than the largest element
Update the pointers of the neighboring nodes to insert the new node
Consider the case where the linked list has only one node
McDonald's order system involves structured data flow from order placement to delivery, ensuring efficiency and accuracy.
1. Customer places an order using a digital kiosk or cashier, which captures order details in a structured format (e.g., JSON).
2. The order is sent to the kitchen display system (KDS), where it is displayed for kitchen staff to prepare.
3. The KDS organizes orders based on priority and preparation tim...
Implement 3 stacks in a single array efficiently
Divide the array into 3 equal parts
Use pointers to keep track of top of each stack
Implement push and pop operations for each stack
Handle stack overflow and underflow cases
Implement spelling and word suggestions for full keyboard phones
Create a dictionary of commonly used words
Use algorithms like Trie or Levenshtein distance to suggest words
Implement auto-correct feature
Recursive mergesort divides array into halves, sorts them and merges them back. O(nlogn) runtime.
Divide array into halves recursively
Sort each half recursively using mergesort
Merge the sorted halves back together
Runtime is O(nlogn)
Iterative version can be written using a stack or queue
Use a hash map to index anagrams by sorting characters as keys.
Create a hash map where the key is the sorted string of characters.
For example, 'top' and 'pot' both map to 'opt'.
Store all anagrams in a list associated with the sorted key.
When querying, sort the input word and retrieve the list from the map.
I applied via Instahyre and was interviewed in Nov 2024. There was 1 interview round.
It was on hackerrank(OA). There were two string and array based medium question.(Part of Blind 75 list)
What people are saying about Microsoft Corporation
Coding practice is a must . DSA concept is a must .
Coding Test 2 which involved a basic array ques . Checked logic ability
Use Selenium to extract values from a dynamic table
Identify the table using its locator (id, class, xpath, etc.)
Iterate through the rows and columns of the table to extract values
Use Selenium commands like findElements and getText to retrieve the values
Handle dynamic content by waiting for elements to be present or visible
To find the union of two arrays in Java, use a HashSet to store unique elements from both arrays.
Create two arrays of strings.
Convert arrays to HashSet to remove duplicates.
Combine both HashSets to get the union of arrays.
I applied via Walk-in and was interviewed in Apr 2024. There was 1 interview round.
Solve sanke and ladder puzzle
I applied via Naukri.com
Asked to write a program for Number palindrome
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Numerical and logical aptitude test
There are 5 rounds on datastructure and algorithm
Some of the top questions asked at the Microsoft Corporation Sdet interview -
based on 1 review
Rating in categories
Software Engineer
2.5k
salaries
| ₹24.9 L/yr - ₹44 L/yr |
Senior Software Engineer
1.5k
salaries
| ₹28.7 L/yr - ₹75.4 L/yr |
Software Engineer2
1.2k
salaries
| ₹33.1 L/yr - ₹60 L/yr |
Software Developer
1.1k
salaries
| ₹22.6 L/yr - ₹40 L/yr |
Consultant
612
salaries
| ₹19.9 L/yr - ₹35 L/yr |
Amazon
Deloitte
TCS