Empresa engajada
Program an iterator for a Linked List which may include nodes which are nested within other nodes. i.e. (1)->(2)->(3(4))->((5)(6). Iterator returns 1->2->3->4->5->6
Sigiloso
I don't remember the specifics of the question since I did the interview quite a while ago. In the interview itself, I tripped up on some of the smaller implementation details. There are more edge cases here than it seems at first.