Microsoft

I was asked to calculate the minimum number of refueling stops a car must make to reach a distant target along a highway, solved using a greedy approach with a max-heap. The interviewer asked me to evaluate an expression string containing nested parentheses and integer operands using two stacks to handle operator precedence. I was asked to find the maximum flow of packets from a source server to a sink server in a capacity-constrained network using the Edmonds-Karp algorithm.