Tip 1: Consistent practice is key to improving your coding skills.
Tip 2: Prepare your resume well by adding at least 2 projects and some work experience, such as an internship.
Tip 1: Prepare your resume well; they may ask you about anything you've written on it.
Tip 2: Include your ratings on coding platforms to showcase your skills.
Two questions of DSA (medium level)
Tip 1: Prepare DP topic in depth and practice more and more.
Input:
4 5
0 1 5
0 2 8
1 2 9
1 3 2
2 3 6
In the given input, the number of vertices is 4, and the number of edges is 5.
In the input, following the number of vertices and edges, three numbers are given. The first number denotes node ‘X’, the second number denotes node ‘Y’ and the third number denotes the distance between node ‘X’ and ‘Y’.
As per the input, there is an edge between node 0 and node 1 and the distance between them is 5.
The vertices 0 and 2 have an edge between them and the distance between them is 8.
The vertices 1 and 2 have an edge between them and the distance between them is 9.
The vertices 1 and 3 have an edge between them and the distance between them is 2.
The vertices 2 and 3 have an edge between them and the distance between them is 6.
1. There are no self-loops(an edge connecting the vertex to itself) in the given graph.
2. There can be parallel edges i.e. two vertices can be directly connected by more than 1 edge.
It was around morning time .
Interviewer was a senior software engineer (working in microsoft for more than 5+ years)
Shortest path followed with some variations like constraints.
Tip 1: Prepare the graph algorithms like Dijkstra's, Bellman-Ford, and Floyd-Warshall.
The interview was held in the afternoon, and the interviewer was the Software Engineering Manager.
During this round, they thoroughly scrutinized my resume, asking questions about my internship, projects, and computer fundamentals, including OS, OOP, and DBMS
Tip 1: Prepare computer fundamentals.
Tip 2: Prepare your projects and internship experiences; they will surely ask you about everything related to them.
It was a Tech + HR round (surprisingly, he asked me 2 coding problems in this round). The interviewer had been working at Microsoft for more than 16 years.
We cannot use the element at a given index twice.
Try to do this problem in O(N) time complexity.
Tip 1: Prepare medium-level questions on platforms like LeetCode focusing on two pointers and maps.
Tip 1: Practice hard questions on this topic on platforms like LeetCode.
Tip 2: An in-depth understanding of graph and tree topics is a must.
Why do you want to join microsoft?
Tip 1: Prepare HR questions.
Tip 2: When they ask if you have any questions for them, do not reply with 'NO'. Ask anything.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?