Tip 1 : Practice and practice coding.
Tip 2 : Go through some good online tutorial.
Tip 1 : Start from latest to old while putting your experience.
Tip 2 : Resume should not be more than 2-3 pages.
For the given binary tree
The level order traversal will be {1,2,3,4,5,6,7}.
1: Take a queue DS.
2: Start from the root of the tree and push root into queue.
3: Then pop from tree and print it.
4: Push left and right node of the popped node into queue.
5: Repeat step 2 to 4 until queue is empty.
1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
1: Take two pointers (slow and fast) pointing to head.
2: Move slow to next and fast to next->next.
3: Compare when slow=fast then it is the middle node.
HR specific questions, like why do you want to join McAfee, expectations etc.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is 3 + 2 * 4 based on operator precedence?