Microsoft Online Assessment Questions 2024

Name	Time	Online Judge	Experience Level	Platform	Difficulty
Even Out Piles  ⭐⭐⭐		N/A	N/A	N/A	Medium
Largest Letter Both Cases  ⭐⭐⭐		N/A	N/A	N/A	Easy
Max Network Rank  ⭐⭐⭐		N/A	N/A	N/A	Hard
Construct Square  ⭐⭐⭐		N/A	N/A	N/A	Hard

Even Out Piles

Largest Letter Both Cases

Max Network Rank

Given a map of n cities, and m roads between them, returns the maximal network rank.

The network rank of a city is the total number of roads that are connected to the city. 

Write a function, given two arrays starts, ends consisting of m integers each and an integer n, where starts[i] and ends[i] are cities at the two ends of the i-th road.

Example:
Input:
starts = [1, 2, 3, 3]
ends = [2, 3, 1, 4]
n = 4
Output:
4
Explanation:
The chosen cities may be 2 and 3, and the four roads connected to them are: (2,1), (2,3), (3,1), (3,4).

 

Construct Square

There are two wooden sticks of lengths A and B respectively. Each of them can be cut into shorter sticks of integer lengths. Our goal is to construct the largest possible square. In order to do this, we want to cut the sticks in such a way as to achieve four sticks of the same length (note that there can be some leftover pieces). What is the longest side of square that we can achieve?
Write a function that given two integers A, B, returns the side length of the largest square that we can obtain. If it is not possible to create any square, the function should return 0.
Examples:
1. Given A = 10, B = 21, the function should return 7. We can split the second stick into
three sticks of length 7 and shorten the first stick by 3.
2. Given A = 13, B = 11, the function should return 5. We can cut two sticks of length 5
from each of the given sticks.
3. Given A = 2, B = 1, the function should return 0. It is not possible to make any square
from the given sticks.
4. Given A = 1, B = 8, the function should return 2. We can cut stick B into four parts.