Microsoft Senior Software Engineer - online Assessment
- Result
- Ongoing
- Posted
- 16 Oct 2025
Summary
I recently completed an online assessment for a Senior Software Engineer position at Microsoft, which featured two Data Structure problems on Hackerrank. I successfully solved one of the problems, which was a knapsack variation, passing all test cases.
How it went
I just finished an online assessment for a Senior Software Engineer role at Microsoft. The assessment was hosted on Hackerrank and presented two Data Structure questions. I focused my efforts on the first problem, which appeared to be a 0/1 knapsack variation, successfully implementing a solution that passed all the provided test cases. Unfortunately, I didn't get a chance to deeply tackle the second problem after ensuring my first solution was robust.
Questions asked (1)
- 01
Maximum Learning with Double Article Cost
Data Structures & Algorithms · Medium
Given
iv(importance/value of articles),articles(base cost of articles), and a budgetp, find the maximum total learning that can be achieved. Each articleihas an importanceiv.get(i)and its acquisition costs2 * articles.get(i). This is a classic 0/1 knapsack problem variant.