Positive experience. Both problems were solved within an hour. The problems included two algorithmic challenges and questions such as, "Describe yourself," "Where did you work before?" and so on.

The second interview was the same, followed by a final interview where we just talked with the interviewer.

There were two problems. The first was reversing a linked list, and the second was finding the lowest common ancestor of nodes in a binary tree, where you have links to the left node, right node, and parent node.