Filter interviews by
The right view of a binary tree shows the nodes that are visible when viewing the tree from the right side.
The right view of a binary tree can be obtained by performing a level order traversal and keeping track of the rightmost node at each level.
Nodes that are visible from the right side are the ones that are the rightmost at their respective levels.
For example, in the binary tree: 1 / \ 2 3 / ...
To change permissions for a file, you can use the chmod command in the terminal.
Use the chmod command followed by the permission code and the file name
Permission codes include 'u' for user, 'g' for group, and 'o' for others, along with 'r' for read, 'w' for write, and 'x' for execute
For example, to give read and write permissions to the user for a file named 'example.txt', you can use 'chmod u+rw example.txt'
Given a Y-linked list, find the node at the intersection point.
Traverse both branches of the Y-linked list and compare nodes.
Use a hash table to store visited nodes and check for intersection.
If one branch is longer, traverse it until it matches the length of the other branch.
Remove duplicate characters from a string while preserving order.
Create an empty string to hold the result.
Iterate through each character in the input string.
If the character is not already in the result string, add it.
Return the result string.
What people are saying about Microsoft Corporation
Traverse a binary tree in spiral order, alternating between left-to-right and right-to-left at each level.
Use two stacks: one for the current level and one for the next level.
Start with the root node in the first stack.
While there are nodes in the current stack, pop nodes and add their children to the next stack in the opposite order.
Switch stacks after each level to alternate the traversal direction.
Example: For ...
Find the lowest common ancestor (LCA) of two nodes in a binary search tree (BST) efficiently.
In a BST, for any node, left children are smaller and right children are larger.
To find LCA of nodes p and q, start from the root.
If both p and q are smaller than the root, LCA lies in the left subtree.
If both p and q are larger than the root, LCA lies in the right subtree.
If one is on the left and the other is on the righ...
Count the occurrences of each character in a given string including special characters.
Create test cases for empty string
Test for string with only one character
Test for string with all characters being the same
Test for string with all characters being different
Test for string with special characters
Math and logical questions
Medium - hard level questions of leetcode
I applied via Company Website and was interviewed in Dec 2023. There were 2 interview rounds.
2 ques med leetcode ques
The right view of a binary tree shows the nodes that are visible when viewing the tree from the right side.
The right view of a binary tree can be obtained by performing a level order traversal and keeping track of the rightmost node at each level.
Nodes that are visible from the right side are the ones that are the rightmost at their respective levels.
For example, in the binary tree: 1 / \ 2 3 / \ /...
I applied via Campus Placement and was interviewed before Jul 2022. There were 3 interview rounds.
Easy array, string based questions
To change permissions for a file, you can use the chmod command in the terminal.
Use the chmod command followed by the permission code and the file name
Permission codes include 'u' for user, 'g' for group, and 'o' for others, along with 'r' for read, 'w' for write, and 'x' for execute
For example, to give read and write permissions to the user for a file named 'example.txt', you can use 'chmod u+rw example.txt'
Given a Y-linked list, find the node at the intersection point.
Traverse both branches of the Y-linked list and compare nodes.
Use a hash table to store visited nodes and check for intersection.
If one branch is longer, traverse it until it matches the length of the other branch.
Count the occurrences of each character in a given string including special characters.
Create test cases for empty string
Test for string with only one character
Test for string with all characters being the same
Test for string with all characters being different
Test for string with special characters
Remove duplicate characters from a string while preserving order.
Create an empty string to hold the result.
Iterate through each character in the input string.
If the character is not already in the result string, add it.
Return the result string.
Traverse a binary tree in spiral order, alternating between left-to-right and right-to-left at each level.
Use two stacks: one for the current level and one for the next level.
Start with the root node in the first stack.
While there are nodes in the current stack, pop nodes and add their children to the next stack in the opposite order.
Switch stacks after each level to alternate the traversal direction.
Example: For a tre...
Find the lowest common ancestor (LCA) of two nodes in a binary search tree (BST) efficiently.
In a BST, for any node, left children are smaller and right children are larger.
To find LCA of nodes p and q, start from the root.
If both p and q are smaller than the root, LCA lies in the left subtree.
If both p and q are larger than the root, LCA lies in the right subtree.
If one is on the left and the other is on the right, th...
The complexity of the codes depends on the number of operations and loops used.
The first code has a complexity of O(n) as it uses a single loop to iterate through the array.
The second code has a complexity of O(n^2) as it uses nested loops to compare each element with every other element in the array.
The complexity of a code can also depend on the type of operations used, such as sorting or searching.
Complexity can be ...
I have a strong academic background with a focus on computer science and engineering.
Graduated with a Bachelor's degree in Computer Science from XYZ University
Completed a Master's degree in Electrical Engineering from ABC University
Took courses in data structures, algorithms, programming languages, and computer networks
Participated in various coding competitions and hackathons
Maintained a GPA of 3.8 throughout my acade...
I am working on this project out of interest and I believe I can improve it by implementing more advanced algorithms and incorporating user feedback.
Implement more advanced algorithms to improve accuracy
Incorporate user feedback to enhance user experience
Optimize code for faster performance
Add more features to increase functionality
My peers would describe me as a reliable and hardworking team player with excellent communication skills.
Reliable and consistent in meeting deadlines and completing tasks
Collaborative and supportive of team members
Clear and effective communicator, both verbally and in writing
Open to feedback and willing to learn and improve
Positive attitude and strong work ethic
I am currently working on a web application for a client in the e-commerce industry.
The project involves developing a user-friendly interface for customers to browse and purchase products.
I chose this project because I have experience in web development and I find the e-commerce industry interesting.
I am also excited about the challenge of creating a seamless checkout process for customers.
The project requires collabor...
I am constantly seeking feedback and learning new skills to improve my performance.
Regularly seeking feedback from colleagues and supervisors
Attending workshops and training sessions to learn new skills
Setting personal goals and tracking progress towards them
Reflecting on past experiences and identifying areas for improvement
Reading industry publications and staying up-to-date with trends
The desire to learn and grow keeps me motivated.
Setting achievable goals
Celebrating small wins
Surrounding myself with positive people
Taking breaks and practicing self-care
Remembering my purpose and passion
Continuously learning and seeking new challenges
My professors would describe me as hardworking and detail-oriented. They have pointed out my weakness in public speaking.
Professors would describe me as hardworking and detail-oriented
Weakness in public speaking has been pointed out
Received positive feedback on assignments and projects
Collaborates well with classmates and participates in group discussions
Short term goal is to learn and contribute to the company. Long term goal is to grow professionally and take on leadership roles.
Short term goal: Learn new skills and technologies
Short term goal: Contribute to the company's success
Long term goal: Grow professionally and take on leadership roles
Long term goal: Build a strong network in the industry
Long term goal: Achieve financial stability
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
Creating test cases for random scenarios ensures software reliability and robustness through diverse input validation.
Identify edge cases: Test with minimum and maximum input values, e.g., an empty array vs. a large array.
Use random data: Generate random inputs to simulate real-world usage, e.g., random user names or passwords.
Test invalid inputs: Ensure the system handles unexpected inputs gracefully, e.g., negative n...
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Some of the top questions asked at the Microsoft Corporation SDE Intern interview -
based on 3 interview experiences
Difficulty level
Duration
based on 1 review
Rating in categories
Software Engineer
2.5k
salaries
| ₹24.9 L/yr - ₹44.2 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹36.7 L/yr - ₹74.8 L/yr |
Software Engineer2
1.2k
salaries
| ₹33 L/yr - ₹60 L/yr |
Software Developer
1k
salaries
| ₹26.1 L/yr - ₹46 L/yr |
Support Engineer
607
salaries
| ₹14.4 L/yr - ₹24.5 L/yr |
Amazon
Deloitte
TCS