Software Engineer

* Initialize three pointers prev as NULL, curr as head, and next as NULL.
* Iterate through the linked list. In a loop, do the following:
* Before changing the next of curr, store the next node 
* next = curr -> next
* Now update the next pointer of curr to the prev 
* curr -> next = prev 
* Update prev as curr and curr as next 
* prev = curr 
* curr = next

Traverse the list individually and keep putting the node addresses in a Hash Table. 
At any point, if NULL is reached then return false 
If the next of the current nodes points to any of the previously stored nodes in Hash then return true.

Assuming the two stacks are: the current level and the next level, we would also need a variable to keep track of the current level order (whether it is left to right or right to left). We pop from the current level stack and print the node's value. Whenever the current level order is from left to right, we push the node's left child, and then its right child to the stack next level. Since a stack is a Last-In-First-Out (LIFO) structure, the next time when nodes are popped off the next level, they will be in the reverse order. On the other hand, when the current level order is from right to left, we would push the node's right child first, then its left child. Finally, do not forget to swap those two stacks at the end of each level (i.e., when the current level is empty).

Tip 1: Be confident 
Tip 2: Be consistent throughout the questions 
Tip 3: Be truthful

Tip 1: Always say yes.
Tip 2: Saying No is a direct rejection 
Tip 3: Be confident

Tip 1: Always be positive
Tip 2: Say yes
Tip 3: Say it would be done if needed.