Applied through a recruiting firm (who, to their credit, were quite efficient).

First phone round went decently. Questions related to the copy constructor and another algorithmic question. I thought my answer on the copy constructor wasn't up to the mark.

Was elated when I got a call for a second phone interview.

Was much better prepared during this interview.

Question 1: Remove duplicate elements in a linked list. Ans: Breezed through this as any developer worth his salt would.

Question 2: Compare two binary trees and return if they are equal. Ans: Suggested a very acceptable solution where we traverse through the trees inorder and store them in vectors, and compare the vectors to check for equivalence. Was quizzed on that.

Summary: Both programs were accurate solutions, and the programs worked on Hackerrank without a hitch. However, the second one was probably not the 100% efficient result they were looking for.

Result: REJECTED.

Copy constructor

Check if two binary trees are equal

Remove duplicate nodes in a linked list