Don't apply to this company if you have more than 5 years of experience building software systems, as you won't be asked a single question on the technologies you have learned or your knowledge of them. It is a great company, however, for people who have recently graduated with a Computer Science degree and still have fresh in their minds all the tricky algorithm questions that you never use in the real world. You must memorize the Big O time complexity of all data structures and some 500 common algorithm questions on LeetCode. I also recommend consolidating all the questions people have mentioned on Glassdoor for the Software Engineer role and practicing them thoroughly.

The interview process consisted of a HackerRank interview that lasted an hour. I was asked questions already available on LeetCode (find the longest substring with unique characters, find the list of nodes matching a given value in a tree by doing any tree traversal) and some basic programming questions in Java around static, exceptions, collections, etc.

After that, I was invited for an onsite. I had 2 technical rounds, with each round containing 2 interviewers.

• The first round had both interviewers asking me briefly about my current role. Then, they asked me to write code on a computer for identifying prime numbers in a range (check LeetCode and memorize the answer that improves performance) and finding the hashcode of a long value (check for bit shifting techniques on Stack Overflow).
• They also asked me some questions on Java 8 features, which I don't think they were interested in knowing the answer to, as I don't believe they have ever used it.
• The second round had one interviewer asking me to write code for a simple problem requiring sorting a collection using an attribute (I used TreeSet and implemented a comparator). The interviewer then asked me what if I changed the TreeSet to a Heap to get the first k elements and what the time complexity of the code would be. The answer is nlogk.
• The other interviewer asked me a design question that required processing a large number of files and extracting data from them.
• I was also asked a simple SQL question that one can answer by doing a regular groupBy and having clause of find count(*) > 10.

After that, I was let go, which pretty much made it clear to me that I was rejected. If you are not proceeding to another round (with HR or a hiring manager) after the first 2 rounds, you are most definitely rejected.

Overall, I felt that their office is great, with quality free snacks, and people seemed to like what they did. Interviewers will not give you any hint whether you are doing good or bad. However, as I mentioned earlier, it is not a place that will ask you about your knowledge of specific technologies (REST, Angular, Caching, Load Balancing, Spring, BigData, etc.). Part of this could be that they already have a stable product, and most of the time, they are working on adding optimizations to the existing product without any significant rewrite using new technologies.

HackerRank Questions:

• Find the longest substring with unique characters in O(n) time.
• Find all nodes matching a given value in a Tree.

Onsite Round 1:

• How do you implement hashCode of a long value?
• Find all prime numbers in a range (e.g., all prime numbers from 1 to 100).

Onsite Round 2:

• Sort a collection using a calculated attribute (fairly simple calculation on finding the frequency of occurrence of a word in an array). Then, change it to find the top K elements using a heap and provide the time complexity.
• Design a file processing system that can handle a large number of files and extract and aggregate data from them.