Filter interviews by
Clear (1)
2 medium leetcode questions were asked
Cf questions asked of rating 1400
TypeScript (ts) is a superset of JavaScript (js) that adds static typing and other features to improve code quality and maintainability.
TypeScript provides static typing, which helps catch errors at compile time rather than runtime.
TypeScript supports modern JavaScript features like classes, interfaces, and modules.
TypeScript can be transpiled into JavaScript, making it compatible with all browsers and environments.
Typ...
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
Complete 2 leetcode questions in 60 minutues
The interview was to build a sudoko game in 3 hours
What people are saying about Microsoft Corporation
The minimum number of operations required to set all elements of a binary matrix to 0 or 1.
Count the number of 0s and 1s in each row and column separately.
For each row and column, choose the minimum between the count of 0s and 1s as the number of operations needed.
Sum up the minimum operations for all rows and columns to get the total minimum operations.
Microsoft Corporation interview questions for designations
I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.
2Coding questions were there
Get interview-ready with Top Microsoft Corporation Interview Questions
I applied via Company Website and was interviewed before Mar 2023. There were 3 interview rounds.
Moderate coding question
1 month long hackathon
I was interviewed in Apr 2021.
Round duration - 90 minutes
Round difficulty - Easy
There were 3 coding questions. All of them were pretty easy and solvable in less than 30 minutes. Some string and pattern matching + some number theory problems were there.
You are provided with a string expression
consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...
Evaluate arithmetic expressions in infix notation with given operators and precedence rules.
Parse the infix expression to postfix using a stack.
Evaluate the postfix expression using a stack.
Handle operators precedence and parentheses while evaluating.
Ensure no division by zero cases and operands fit in 32-bit integer.
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
A subarray can be derived from th...
Find the contiguous subarray with the maximum product of elements in an array.
Iterate through the array and keep track of the maximum and minimum product ending at each index.
Update the maximum product by taking the maximum of current element, current element * previous maximum, and current element * previous minimum.
Update the minimum product by taking the minimum of current element, current element * previous maximum...
Given a specific time in hours and minutes, your task is to calculate the smallest possible angle between the hour hand and the minute hand of a clock.
Calculate the smallest angle between the hour and minute hands of a clock given a specific time.
Calculate the angle formed by the hour hand with respect to 12 o'clock position
Calculate the angle formed by the minute hand with respect to 12 o'clock position
Find the absolute difference between the two angles and take the minimum of the two possible angles
Return the floor value of the calculated angle
Round duration - 45 minutes
Round difficulty - Medium
This was a technical round. First after properly introducing ourselves(me and the interviewer), we started with the main interview. I was asked 2 questions, one DS and Algorithms and the other System Design question.
You are provided with a Binary Tree consisting of 'N' nodes, where each node holds an integer value. Your objective is to identify and list all nodes that do not possess a...
Identify and list nodes in a Binary Tree that do not have a sibling.
Traverse the Binary Tree in level order and keep track of nodes without siblings.
Check if each node has a sibling by comparing with its parent's other child.
Output the values of nodes without siblings in ascending order.
Handle cases where the root node is considered a sibling node.
Design an elevator system for a single building with N floors.
Create a data structure to track the current floor of the elevator and the requested floors.
Implement algorithms for elevator movement such as FIFO, SCAN, or LOOK.
Consider factors like peak hours, weight capacity, and emergency situations.
Include features like door open/close buttons, emergency stop button, and floor selection panel.
Tip 1 : Make sure to solve the most recommended problems of LeetCode. Around 200 will do
Tip 2 : Be confident with your basics of chapters from Operating Systems and DBMS or SQL Queries.
Tip 3 : Have a slight knowledge of system designing concepts.
Tip 1 : Make your Resume such that it is properly readable. Keep it of one page. If it exceeds try your best to include only the most important highlights.
Tip 2 : Put your most important achievements at the top and after than the not so important ones. You want the interviewer to see them first.
I was interviewed in Jan 2021.
Round duration - 75 minutes
Round difficulty - Hard
This round was scheduled in the evening hours and all the participants were required to fill a form which was shared 2 days prior to the test date. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.
Given a binary tree with N
nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true
; otherwise, return false
.
A binary search tree (BST)...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Ensure that both the left and right subtrees are also binary search trees.
Given a string A
consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A
.
Find the length of the longest palindromic subsequence in a given string.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of palindromic subsequences for different substrings.
Fill the array diagonally based on the characters in the string.
Return the length of the longest palindromic subsequence for each test case.
Round duration - 45 minutes
Round difficulty - Medium
There was only one female interviewer for this round. She continuously interacted with me and was giving me some good situational problems that were not very easy to answer. Basically those were open-minded questions which can be answered both ways and that's why I found it quiet hard as per my nature but at the end things went well for me.
Tip 1 : Practice all DSA questions from interview bit
Tip 2 : Do Atleast 3 project one should be major, if it's in web dev it would be beneficial.
Tip 3 : Should be good in communication skills
Tip 1 : Not more than 1 page
Tip 2 : Have atleast 3 projects with some achievement in coding contest and your coding handle should be mentioned like codechef, codeforces etc
Tip 3 : Try to keep only those things in resume in which you find yourself comfortable with
I was interviewed in Dec 2020.
Round duration - 60 Minutes
Round difficulty - Easy
There were 3 coding questions of various difficulty level
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and update.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the order of keys in the linked list whenever a key ...
You are given an array 'ARR'
of size 'N'
consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...
Determine minimum operations to make all array elements equal using addition, subtraction, multiplication, or division.
Iterate through array to find the maximum and minimum elements.
Calculate the difference between maximum and minimum elements.
The minimum number of operations needed is the difference between the maximum and minimum elements.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations
Check if the current placement is safe by verifying rows, columns, and diagonals
Print valid configurations where queens do not attack each other
Round duration - 80 Minutes
Round difficulty - Easy
Asked various coding questions and their implementations
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...
Reverse a given stack of integers using recursion without using extra space or loops.
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 using recursion.
Make use of the top(), pop(), and push() stack methods provided.
Example: If the input stack is [1, 2, 3], after reversal it should be [3, 2, 1].
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the problem statement.
Round duration - 30 Minutes
Round difficulty - Easy
HR was very friendly
Tip 1 : Don't lie over your resume
Tip 2 : Practice regularly
Tip 3 : Revision is the key
Tip 1 : Right only correct info, Don't fake it
Tip 2 : Keep it precise and concise.
I was interviewed in Dec 2020.
Round duration - 120 Minutes
Round difficulty - Easy
Total 3 coding questions were there, out of which I don't remember the last one.
Ninja is organizing a dance competition and wants to pair participants using a unique method. Each participant chooses a number upon entry, and Ninja selects a nu...
Find the number of distinct pairs of participants with a given difference in their chosen numbers.
Iterate through the list of numbers and check for pairs with the required difference 'K'.
Use a hash set to keep track of unique pairs to avoid counting duplicates.
Return the size of the hash set as the number of distinct pairs.
You are given two strings 'A' and 'B'. While string 'A' is constant, you may apply any number of left shift operations to string 'B'.
Your task is to calcu...
Calculate minimum left shift operations to achieve longest common prefix between two strings.
Apply left shift operations to string B to find longest common prefix with string A
Count number of shifts needed to achieve longest common prefix
Handle circular rotation of characters in string B
Return minimum number of left shift operations for each test case
Round duration - 60 Minutes
Round difficulty - Easy
Given a square matrix 'MATRIX' of non-negative integers, rotate the matrix by 90 degrees in an anti-clockwise direction using only constant extra space.
Rotate a square matrix by 90 degrees in an anti-clockwise direction using constant extra space.
Iterate through each layer of the matrix from outer to inner layers
Swap elements in groups of 4 to rotate the matrix
Handle odd-sized matrices separately by adjusting the loop boundaries
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into sections for 0s, 1s, and 2s.
Iterate through the array and swap elements based on their values and the pointers.
After sorting, the array will have 0s at the beginning, followed by 1s, and then 2s.
Round duration - 60 Minutes
Round difficulty - Easy
This was HR + Technical round
He started with questions on projects and Os and Dbms and Oops
Then asked one coding question
You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.
An island is defined as a group of 1s (re...
The task is to determine the number of islands in a grid of 0s and 1s connected horizontally, vertically, or diagonally.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s forming islands
Mark visited cells to avoid counting the same island multiple times
Count the number of islands found during DFS traversal
Tip 1 : Maintain At least 2 projects in your resume.
Tip 2 : Be Confident enough
Tip 3 : Solve lot of problems
Tip 1 : Achievements are good to have
Tip 2 : You should be able to answer all the questions related to skills in the resume.
based on 7 interviews
3 Interview rounds
based on 18 reviews
Rating in categories
Software Engineer
2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
599
salaries
| ₹0 L/yr - ₹0 L/yr |
Support Engineer
552
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Deloitte
TCS