Linked List traversal, Fibonacci algorithm (basic and recursive), the difference in complexity between the basic and recursive. Relatively straight forward. Second phone screen: "A person on a stairway needs to get from the bottom of the stairs to the top in the minimum number of steps, no, how possible combinations of steps, no, I don't think I explained that well...what if they took could only take one step forward for every"...really? is this even a real question? somehow the answer was yet again a Fibonacci sequence question. Next was reversing a singly linked list - oops, you can't use any references (!?), or another linked list.. Frustrating to have gotten the "B" team interviewer
