Michigan Tag Interview Questions and Answers

Round duration - 120 minutes
Round difficulty - Easy

There were few mcqs. MCQs were easy but coding questions were little complex.

Q1. 
Minimum and Maximum Candy Cost Problem
Ram is in Ninjaland, visiting a unique candy store offering 'N' candies each with different costs. The store has a special offer: for every candy you purchase, you c...read more
Ans. 
Determine the minimum and maximum amounts of money needed to purchase all candies with a special offer.
• Iterate through each test case to calculate the minimum and maximum costs

• For minimum cost, sort the candy costs and take the lowest 'K' values

• For maximum cost, sort the candy costs in descending order and take the highest 'K' values

• Consider edge cases like when K is 0 or equal to N
Answered by AI
Add your answer
Q2. 
Multiply Linked Lists Problem Statement
Your task is to multiply two numbers represented as linked lists and return the resultant multiplied linked list.
Explanation:
The multiplied list should be a lin...read more
Ans. 
Multiply two numbers represented as linked lists and return the resultant multiplied linked list.
• Create a function that takes two linked lists as input and returns the product as a linked list

• Traverse both linked lists to extract the numbers, multiply them, and create a new linked list with the result

• Handle carry over digits appropriately while multiplying the numbers
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Round was very difficult . I prefer first just try to learn how to operate hackerrank site, only then you can good with it. It was an online coding round. To clear coding rounds you have to clear your basics.

Q1. 
Right View of Binary Tree
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...read more
Ans. 
The task is to output the right view of a binary tree given its level order traversal.
• Traverse the tree level by level and keep track of the rightmost node at each level

• Use a queue to perform level order traversal

• Print the rightmost node at each level to get the right view

• Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1 3 6 7
Answered by AI
Add your answer
Q2. 
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...read more
Ans. 
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
• Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks.

• Keep track of the maximum profit that can be achieved by considering all possible combinations of buy and sell transactions.

• Ensure that you sell the stock be...read more
Answered by AI
Add your answer

Round duration - 35 minutes
Round difficulty - Medium

Basic interview questions, few related to basic domain questions, few from behavioral questions, few from projects. This round was not that much hard.