Microsoft Research SDE Intern Interview Questions and Answers

2 DSA questions and 70 minutes.

Q1. Implement Min-stack using O(N) space .
Ans. 
Min-stack is implemented using O(N) space by keeping track of minimum value at each element.
• Use two stacks - one to store the actual elements and another to store the minimum value at each step.

• When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.

• When popping an element, also pop from the minimum stack if the popped element is the current minimum.
Answered by AI
Add your answer
Q2. Sliding Window Problem.
Ans. 
Sliding Window Problem involves finding a subarray of fixed size k with the maximum sum.
• Use a sliding window approach to iterate through the array and keep track of the sum of elements within the window.

• Slide the window by removing the first element and adding the next element in each iteration.

• Keep track of the maximum sum found so far and update it if a new maximum is found.
Answered by AI
Add your answer

Q1. Tell us about yourself.
Ans. 
I am a computer science student with a passion for coding and problem-solving.
• Currently pursuing a degree in computer science

• Proficient in programming languages like Java, Python, and C++

• Experience with data structures and algorithms

• Completed internships at tech companies like Google and Microsoft
Answered by AI
Add your answer
Q2. Can you explain any recent projects you have worked on?
Ans. 
Developed a web application for tracking personal fitness goals and progress.
• Used React for front-end development

• Implemented RESTful APIs using Node.js and Express for back-end

• Utilized MongoDB for database storage

• Incorporated chart.js for visualizing progress data
Answered by AI
Add your answer
Q3. Given a sorted linked list, how can you remove duplicates from it?
Ans. 
Remove duplicates from a sorted linked list
• Use two pointers - one to iterate through the list and another to keep track of unique elements

• Compare current node with next node, if they are equal, skip the next node

• Repeat until end of list is reached
Answered by AI
Add your answer
Q4. There was a String based leetcode hard level question
Add your answer

Easy lc or medium lc quest

Q1. Coding round only was
Add your answer

2 hours mcqs from all cse related topics + 1 coding question

3 coding questions easy level

Q1. I do not remember
Add your answer

It was a 2 hour test having 2 coding questions . Difficulty was easy and medium.

Q1. Two questions were asked . To make a BST from array elements . Snakes and ladder. Besides this interviewer also asked about my projects and basic introduction.
Add your answer

OA + behavioural questions

Q1. Leetcode medium
Add your answer

Q1. Leetcode medium
Add your answer

Don;t remember the leetcode question, was medium

Don't remember the leetcode qyuestion, was medium, had a behavior component, remember the Amazon principles

Duration: 1hr+
Topics: 2 - coding questions(logic-based)
platform: Hackerank

Q1. Find the square root of a number using only 4 basic arithmetic operations (+,-,*,/) without using a power operator and inbuilt libraries. For numbers that are not perfect squares, print the integer part of...read more
Ans. 
Find square root of a number using basic arithmetic operations without power operator and inbuilt libraries.
• Use binary search to find the integer part of the square root

• Use long division method to find the decimal part of the square root

• Repeat the above steps until desired accuracy is achieved

• Handle edge cases like negative numbers and numbers less than 1
Answered by AI
Add your answer
Q2. Addition of two linked lists, and finallt return the result as a linked list
Add your answer