SDE - Intern
Microsoft
2 rounds | 4 Coding problems
134 views
Interview preparation journey
Preparation
Duration: 2 months
Topics: Data Structures, Operating System, OOPS, Project, CN
Tip

Tip 1 : Practice Questions and focus on grabbing the concept rather than increasing the count.
Tip 2 : Whatever Keyword you use in your CV- Projects or skills known should be well prepared and in-depth Knowledge of the Project such as how to make it Efficient, shortcomings, and Scalability issues should be known.
Tip 3 : Work on Communication skills, very important for MNCs.

Application process
Where: Campus
Eligibility: 8 CGPA
Resume tip

Tip 1 : Include good projects and have in-depth knowledge about them, this would increase the chances of your resume getting shortlisted
Tip 2 : Only mention relevant and known skills because it is quite possible that the interviewer starts asking questions about any of those topics.

Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date25 Jul 2022
Problems2
Minimum Deletion Cost to Avoid Repeating Letters

Ninja has given a string 'S' of lowercase characters of size 'N'. He also has provided an array 'COST' where 'COST[i]' refers to the Cost of deleting the ‘i’th character in the string.

view more
Problem approach

We will traverse the string from left to right. For each substring that contains the same characters, we calculate the sum of the costs and the maximum cost mx. We add sum-mx to the answer.
I have attached the code for reference:
class Solution {
public:
int minCost(string s, vector& cost) {
int i = 0, N = s.size(), ans = 0;
while (i < N) {
int j = i, sum = 0, mx = 1...

view more
Minimum Cost to Connect All Points

You are given an array, ‘COORDINATES’ that represents the integer coordinates of some points on ...

view more
Problem approach

The problem requires us to calculate the longest path using an adjacency list and keeping a variable mx to keep a count of max. I have attached the code for reference:
#include

int longest_path(int node,int parent, bool odd,vector adj[])
{
if(odd &&(node%2==1))
return 0;
int mx=0;
{
{
bool sOdd=odd| (n...

view more
02
Round
Easy
Video Call
Duration40 minutes
Interview date1 Aug 2022
Problems2

You are a product manager and currently leading a team to develop a new version of a product. Unfortunately, t...

view more
Problem approach

It was a very simple binary search problem, I initially told the interviewer about my approach. The first approach was Brute force that is linear seach after which he asked me to optimize it and then i told him about muy approach of linear search to reduce complexity and he asked me to code it.
I have attached it for reference:

class Solution {
pu...

view more
DBMS Questions

Types of Joins
How to choose primary key?
What are views?
What will you do if you want the top 5 records from a table?

Problem approach

Tip 1 : Read SQL Queries
Tip 2 : Read DBMS interview questions
Tip 3 : Focus on Keywords

Start a Discussion
Similar interview experiences
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
2813 views
SDE - 1
4 rounds | 6 problems
Interviewed by Microsoft
1730 views
SDE - Intern
3 rounds | 6 problems
Interviewed by Microsoft
31 views
SDE - 1
3 rounds | 5 problems
Interviewed by Microsoft
45 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16756 views