I faced three one-on-one interview rounds, each with one coding question.

• Round 1: Given an undirected graph and a node, modify the graph into a directed graph such that any path leads to one particular node.
• Round 2: Given a matrix of size m x n and a list of cells, find the number of paths from the top-left cell to the bottom-right cell.
• Round 3: Solve a linear equation in one variable, where the possible operands are +, -, and * along with brackets. For example: (2x + 5 - (3x-2)=x + 5).

The interviewers themselves were very helpful, prodding me towards the right answer. It was a good experience overall.

The questions weren't tough, as such. I fumbled a bit with the code for the matrix question, which I guess could have been handled better.