Microsoft SDEII Technical Phone Screen Interview: OA Challenges

This post was last edited by juliaxx on 2025-10-3 20:05. I received a hiring event from LinkedIn, but the recruiter only offered an interview for SDEII. The online assessment (OA) had two questions. T

This post was last edited by juliaxx on 2025-10-3 20:05. I received a hiring event from LinkedIn, but the recruiter only offered an interview for SDEII. The online assessment (OA) had two questions. The first question didn't seem to be the original one, and the second was about finding the distance on a weighted graph (the last 4 test cases weren't posted). I'd appreciate some points. Thank you everyone. Question 1: The following content requires a score higher than 200. You can already view it. Given a positive integer n, you can either add or subtract power(2, i) where i >= 0. What is the minimum operations to reduce n to 0?

input n is long. Question 2 The following content requires points higher than 200. You can already browse a person living in the country that has road_nodes houses and m roads. The ith road runs from house x[i] to house y[i] and has a length of t[i]. The road is directional meaning you can not travel from house y[i] to x[i]. For each house x, find the minimum journey that starts and ends at house x. 1<= x <= road_nodes. if no journey exists,

return 0 for that house. There can be a road that starts and end at the same house, all houses may or may not be connected, there are no multiple roads between 2 houses.