Filter interviews by
Be the first one to contribute and help others!
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 1 hour
Round difficulty - Medium
You are provided with an integer array ARR
of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...
Find the smallest positive integer missing from an array of integers.
Iterate through the array and mark positive integers as visited by changing the sign of the corresponding index.
After marking all positive integers, iterate again to find the first positive integer with a positive value.
Return the index of the first positive integer found plus one as the answer.
Tip 1 : During an interview, never say that you don't know the answer, keep trying and the interviewer will help you himself.
Tip 2 : Keep speaking up the approach going on in your mind, they want to judge your approaches much more than whether the answer is right or wrong.
Tip 3 : Be confident, cheerful, keep smiling, and continue making eye contact with the interviewer, this leaves a positive impression.
Tip 4 : Search and practice questions specific to the company, questions are repeated several times.
Tip 5 : A sound knowledge of Microsoft Azure Services and cloud computing will be an icing on the cake, and increase your chances to get selected.
Tip 6 : Keep giving contests on coding platforms, it will help you to stay motivated and check your stand.
Tip 7 : Keep a daily goal of number of questions instead of the time duration.
Tip 1 : Everything mentioned on the resume should be thoroughly known to you since if they catch you being dishonest, pretty good coding skills also might not help.
Tip 2 : Have projects related to the same field you are trying to apply for mentioned in your resume, this shows you are already experienced in the field.
Tip 3 : Adding references of some experienced people of the same field might help you gain their trust.
Tip 4 : Do not keep your resume too long, and do not mention irrelevant details, keep it short and crisp.
Tip 5 : Some experience in the field of operations and management or some positions of responsibility will really help you score extra points since it shows you have leadership qualities and are familiar with the market along with super coding skills.
posted on 8 Apr 2021
posted on 5 Dec 2021
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Use Dijkstra's algorithm to find the shortest path between 2 vertices in a graph.
Implement Dijkstra's algorithm to find the shortest path
Create a priority queue to keep track of the vertices with the shortest distance
Use a visited set to avoid revisiting vertices
Stop when the destination vertex is reached
Return the shortest path found
Example: finding the shortest path between A and D in a graph with weighted edges: A->...
Find pairs in an array with sum equal to 0.
Use a hash table to store the frequency of each element.
Iterate through the array and for each element, check if its complement (negative value) exists in the hash table.
If it exists, add the frequency of the complement to the count of pairs.
Return the count of pairs.
Example: array = [2, -2, 3, 0, -3], pairs = 2 (-2, 2 and -3, 3)
posted on 19 May 2022
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
The binary tree is represented i...
Print nodes of a binary tree in spiral order traversal.
Use a queue to perform level order traversal of the binary tree.
Alternate between printing nodes from left to right and right to left at each level.
Handle null nodes represented by '-1' appropriately.
Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.
Round duration - 60 Minutes
Round difficulty - Easy
You are given a list of N
strings called A
. Your task is to determine whether you can form a given target string by combining one or more strings from A
.
The strings from A
c...
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
Iterate through all possible combinations of strings from the list to form the target string.
Use recursion to try different combinations of strings.
Check if the current combination forms the target string.
Return true if a valid combination is found, otherwise return false.
Round duration - 60 Minutes
Round difficulty - Easy
Design an elevator system for efficient vertical transportation.
Divide building into zones to optimize elevator usage.
Implement algorithms for efficient elevator scheduling.
Include safety features like emergency stop buttons and overload sensors.
Consider user interface for passengers to select floors and monitor elevator status.
Tip 1 : Never give up
Tip 2 : Practice
Tip 3 : Be positive
Tip 1 : Keep it short
Tip 2 : Highlight skills and achievements
posted on 20 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
The online coding round took place at 9:30 am in the morning. The platform was new so I got familiar with it in advance, a night before, to avoid any hassle during the test. There was camera proctoring and laptop screen sharing throughout the test. Multiple programming languages like Java, C, C++ and Python were allowed. There were 3 coding questions based on DSA. Questions were different for different candidates.
You are provided with an array of strings, and your objective is to determine the number of unique strings within it.
A string is deeme...
Given an array of strings, determine the number of unique strings that cannot be transformed into another string by swapping characters at odd or even indices.
Iterate through each string in the array and check if it can be transformed into another string by swapping characters at odd or even indices.
Keep track of unique strings that cannot be transformed and return the count.
Example: For array = ["abcd", "cbad", "bdac"...
Given two strings 'P' and 'Q' of equal length, determine if string 'P' can be transformed into string 'Q' by cyclically rotating it to the right any num...
Check if one string can be transformed into another by cyclically rotating it to the right.
Iterate through all possible rotations of string P and check if any of them match string Q.
Use string concatenation to simulate cyclic rotations efficiently.
Compare the rotated strings with string Q to determine if they are equivalent.
You have been provided with an array where each element specifies the number of buses that can be boarded at each respective bus stop. Buses will only stop at locations that...
Given an array representing number of buses at each bus stop, determine how many buses originate from each stop.
Iterate through the array and for each element, increment the count of buses originating from the corresponding bus stop.
Use an array to store the count of buses originating from each stop.
Remember to consider the constraint of 1-based indexing for bus stops.
Round duration - 45 Minutes
Round difficulty - Medium
The interview took place through Microsoft Teams at 2:00 pm. The platform was smooth and the interviewer was very friendly and told me that he isn't looking for bookish language answers but he only wants to check my understanding of CS subjects.
Given an array of integers representing the heights of mountains, determine the length of the longest subarray that forms a mountain shape.
A mountain subarray...
Find the length of the longest mountain subarray in an array of integers.
Iterate through the array to find peaks.
Expand from peaks to find ascending and descending slopes.
Track the length of the mountain subarray and return the maximum length.
Round duration - 55 Minutes
Round difficulty - Medium
The interview was conducted on Microsoft Teams and the interviewer was very friendly. He made sure I was comfortable and described his role at Microsoft.
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Use a sorting algorithm like quicksort or heapsort for efficiency.
Ensure the array contains distinct positive integers for accurate results.
ACID properties in DBMS ensure data integrity and consistency.
Atomicity: All transactions are either fully completed or fully aborted. For example, transferring money from one account to another should be completed in its entirety.
Consistency: The database remains in a consistent state before and after the transaction. For example, if a constraint is violated during a transaction, the transaction will be rolled back.
Is...
Round duration - 60 Minutes
Round difficulty - Hard
The interview was conducted on Microsoft Teams and code was written on Notepad (screen shared). The interviewer was friendly and gave hints to reach the final solution.
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...
Design a data structure supporting insert, delete, search, and getRandom operations in constant time.
Use a combination of hashmap and array to achieve O(1) time complexity for all operations.
For insert operation, check if element exists in hashmap, if not add to array and hashmap.
For remove operation, check if element exists in hashmap, if yes, remove from array and hashmap.
For search operation, check if element exists...
You are given a Binary Search Tree (BST), and your task is to convert it into a sorted Doubly Linked List (DLL).
Consider the provided BST. The goal is ...
Convert a Binary Search Tree to a sorted Doubly Linked List efficiently.
Implement a function to convert a BST to a sorted DLL.
Use in-order traversal to efficiently convert the BST to DLL.
Maintain pointers for the head and tail of the DLL.
Ensure the left child of a node becomes the previous node and the right child becomes the next node in the DLL.
Tip 1 : The most important topic to prepare is DSA, everything else is secondary. Don't run behind advanced technologies if your DSA concepts are not strong.
Tip 2 : Make sure you know the fundamentals of the programming language you code in, apart from OS, OOP and DBMS concepts. Knowledge of these topics showcase your interest in Computer Science, in general.
Tip 3 : Practice by giving contests on Leetcode and other coding platforms. Don't focus on your score or rank, just focus on your learning.
Tip 1 : Make sure your resume is well structured and only 1 page, if you are a fresher. It should include relevant sections like Work Experience (Any past internships), PORs (Any college society you were a part of), Personal Projects and Achievements that you wish to showcase.
Tip 2 : Proofread your resume multiple times. Get it reviewed by your seniors or your friends to ensure there are no grammatical mistakes or spelling errors as it gives a bad impression.
posted on 4 Mar 2021
Learning programming languages is important for software engineers to effectively communicate with computers and develop software solutions.
Programming languages are the foundation of software development.
Learning multiple languages expands the range of problems a software engineer can solve.
Different languages have different strengths and are suited for different tasks.
Knowing multiple languages improves adaptability ...
I applied via Company Website and was interviewed before Sep 2020. There were 3 interview rounds.
I appeared for an interview in Jan 2021.
Merge sort and Quick sort are sorting algorithms while Fibonacci is a sequence of numbers.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half and then merges them.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot.
Fibonacci is a sequence of numbers where each number is the sum of the two precedin...
I applied via Company Website and was interviewed in Nov 2020. There were 3 interview rounds.
Software Engineer
4
salaries
| ₹7 L/yr - ₹10.5 L/yr |
Software Developer
3
salaries
| ₹10.5 L/yr - ₹12 L/yr |
Senior Software Engineer
3
salaries
| ₹8 L/yr - ₹10 L/yr |
24/7 Customer
Microsoft Corporation
SAP