Question 1: Check if a string, composed of various brackets, braces, and parentheses, is valid.
Question 2: Given a large rectangle and a set of smaller rectangles, find if there exists a subset of the small rectangles that can perfectly fill the large rectangle.
Question 3: Given a string of parentheses, balance the string in as few moves as possible. Return the set of moves used to balance the string.
Question 4: Given a tree, where each node holds an integer value, find if there exists a path from the root node to a leaf node that equals a given sum.
The following metrics were computed from 2 interview experiences for the Microsoft Software Engineer I/II role in Redmond, Washington.
Microsoft's interview process for their Software Engineer I/II roles in Redmond, Washington is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Microsoft's Software Engineer I/II interview process in Redmond, Washington.