Filter interviews by
The variation of the 2-sum problem involves finding pairs in an array that meet specific criteria.
Identify the target sum and the array of numbers.
Use a hash map to store numbers and their indices for quick lookup.
Iterate through the array, checking if the complement (target - current number) exists in the hash map.
Example: For array [2, 7, 11, 15] and target 9, the pair (2, 7) sums to 9.
Consider edge cases like d...
Design a REST API for a software engineer interview
Define the resources and endpoints
Use HTTP methods for CRUD operations (GET, POST, PUT, DELETE)
Implement authentication and authorization
Use JSON for data exchange format
Include error handling and status codes
Use binary search to find the minimum distance to escape aggressive cows in a field.
Implement a function to check if cows can be placed with a minimum distance in a field.
Use binary search to find the minimum distance that satisfies the condition.
Keep track of the maximum distance found so far while performing binary search.
Implementing stack using linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer
Implement push() method to add element to top of stack
Implement pop() method to remove element from top of stack
Implement peek() method to return top element without removing it
What people are saying about Microsoft Corporation
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Elements are added with a priority level and retrieved in order of priority
Can be implemented using a heap data structure
Operations include insert, delete, and peek
Can be used in algorithms such as Dijkstra's shortest path algorithm
Program to store and reconstruct a tree from a file with efficient techniques.
Use a recursive approach to traverse the tree and write each node to the file
Include information about the node's parent and children in the file
Use a unique identifier for each node to reconstruct the tree from the file
Use a data structure like a hash table to store the nodes and their identifiers for efficient reconstruction
Backend server code for a tic tac toe game
Create a RESTful API using a framework like Express.js
Implement game logic to check for winning conditions
Use a database to store game state and user information
Handle user authentication and authorization
Implement real-time updates using WebSockets
Yes, it is possible to get the accurate result from the given data.
The coordinates (i,j,k) where metallic balls are present can be determined by finding the set elements in both matrix1 and matrix2.
Additional data is not required as the given data is sufficient to determine the coordinates.
The coordinates can be obtained by iterating through the elements of matrix1 and matrix2 and checking for set elements.
Print all downward paths from any node in a binary tree with sum of elements equal to N.
Traverse the binary tree and keep track of the sum of elements in the path from root to current node.
If the sum equals N, print the path from root to current node.
Recursively traverse the left and right subtrees with updated sum.
Use a stack to keep track of the current path being traversed.
Example: Binary tree with root 1, left...
To find n-k th element from last in a string of unknown length
Traverse the string to find its length
Calculate the position of n-k th element from last
Traverse the string again to find the element at calculated position
I appeared for an interview in Jun 2024.
2 DSA qns on codility
Graphs are data structures that consist of nodes and edges connecting them.
Graphs can be directed or undirected.
Common graph traversal algorithms include BFS and DFS.
Examples of graphs include social networks, road networks, and computer networks.
PRACTISE CODING properly..........
Implementing stack using linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer
Implement push() method to add element to top of stack
Implement pop() method to remove element from top of stack
Implement peek() method to return top element without removing it
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Elements are added with a priority level and retrieved in order of priority
Can be implemented using a heap data structure
Operations include insert, delete, and peek
Can be used in algorithms such as Dijkstra's shortest path algorithm
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
Heavy Dsa was found minimum leetcode hard
I applied via Campus Placement
Print all downward paths from any node in a binary tree with sum of elements equal to N.
Traverse the binary tree and keep track of the sum of elements in the path from root to current node.
If the sum equals N, print the path from root to current node.
Recursively traverse the left and right subtrees with updated sum.
Use a stack to keep track of the current path being traversed.
Example: Binary tree with root 1, left chil...
Yes, it is possible to get the accurate result from the given data.
The coordinates (i,j,k) where metallic balls are present can be determined by finding the set elements in both matrix1 and matrix2.
Additional data is not required as the given data is sufficient to determine the coordinates.
The coordinates can be obtained by iterating through the elements of matrix1 and matrix2 and checking for set elements.
Backend server code for a tic tac toe game
Create a RESTful API using a framework like Express.js
Implement game logic to check for winning conditions
Use a database to store game state and user information
Handle user authentication and authorization
Implement real-time updates using WebSockets
Program to store and reconstruct a tree from a file with efficient techniques.
Use a recursive approach to traverse the tree and write each node to the file
Include information about the node's parent and children in the file
Use a unique identifier for each node to reconstruct the tree from the file
Use a data structure like a hash table to store the nodes and their identifiers for efficient reconstruction
I applied via Campus Placement
To find n-k th element from last in a string of unknown length
Traverse the string to find its length
Calculate the position of n-k th element from last
Traverse the string again to find the element at calculated position
Count the number of unique occurrences in an array of strings.
Create a hash table to store the count of each string occurrence.
Iterate through the array and update the count in the hash table.
Count the number of unique occurrences by counting the number of keys in the hash table.
I applied via Monster and was interviewed before Apr 2020. There was 1 interview round.
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
Some of the top questions asked at the Microsoft Corporation Software Engineer interview for freshers -
The duration of Microsoft Corporation Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 3 interview experiences
Difficulty level
Duration
based on 147 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 L/yr |
Support Engineer
607
salaries
| ₹14.4 L/yr - ₹24.5 L/yr |
Amazon
Deloitte
TCS