Round 1: Hiring Manager Round
Questions: Discussed about past work and tech stacks involved. The manager was more interested in C++ related depth since it was required for the role. Also discussed about work in Singlestore and the team for which I was getting interviewed.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Technical Round (Navigating into Unknown Codebase)
Questions: Task: Remote login into an EC2 instance through terminal. The interviewer helped with the commands required to login. Once logged in, I navigated into the codebase for memcached. I was told to introduce a new feature for memcached with the help of an existing feature and consider atomic operations for the new feature too. The existing functionality should not break.
Candidate's Approach
I successfully logged in and navigated the codebase, implementing the new feature while ensuring that the existing functionality remained intact. I completed the task within the given hour and ran a few test cases.
Interviewer's Feedback
No feedback provided.
Round 3: Technical Round (Optimizing the SQL Query)
Questions: Task: I was given a SQL query running on a codebase involving 200-300 lines of code. The interviewer asked me to refactor the code to optimize the SQL query performance. I pointed out places where changes were needed to improve performance. However, I was unable to run the SQL query at the end to demonstrate the changes due to time constraints.
Candidate's Approach
I identified areas in the code that required changes to enhance the SQL query's performance but could not demonstrate the changes due to time limitations.
Interviewer's Feedback
No feedback provided.
Round 4: Technical Round (DSA)
Questions: Variation of Populating Next Right Pointers in Each Node, but the tree is not perfect, meaning leaves can exist on different levels. The exact question was to connect leaf nodes to the next leaf node on the same level and to nullptr if there is no leaf node to the right. Additionally, the rightmost leaf node's next pointer should connect to the leftmost leaf node in the next level. I solved it with a basic BFS approach using a queue but was told to solve it in O(1) space. Recursion was not an option due to stack space constraints. I was unable to solve it in O(1) space.
Candidate's Approach
I attempted to solve the problem using a BFS approach with a queue but could not meet the O(1) space requirement as recursion was not allowed.
Interviewer's Feedback
No feedback provided.