Very friendly asked to implement a binary search tree using specific methods which caught me off guard as I wasn't familiar with the printing method requested so it took me more time to sole the question
Interview questions [1]
Question 1
Binary Search tree implementation using built in methods
I applied online through the careers website and I was contacted by the recruiter for initial screening after 2 weeks of my application. I received a hackerrank challenge after the phone screening.
Interview questions [1]
Question 1
2 coding questions
1) Related to string manipulation
2) Graph
I applied online. I interviewed at Pocket Gems (San Francisco, CA)
Interview
I was given 2 online coding challenges until I received a 1-hour technical interview over the phone. I didn't make it past this round.
I was disappointed in the phone interview because the coding problem that was given to me contained a "made-up" logical operator that I was not familiar with. The interviewer ended up spending almost 20 minutes trying to (badly) explain to me the behavior of this operator so I ended up running out of time before solving the problem.
This was frustrating because the problem itself was not difficult (related to constructing a trinary tree given string input) but the expected behavior of this operator was ill-defined and hence made it difficult to construct the tree correctly.