i applied via amazon jobs portal.

OA: 2 questions - i was able to solve both.

interview:

1st round:
1) zigzag traversal of binary tree
2) detect loop in linkedlist
note: was asked math behind slow and fast pointer approach.
i solved both.

2nd round:

1. question based on boyer-moore
   i was not able to give the boyer-moore approach.

2. maximum path sum of binary tree.

i couldn't solve the 2nd question.