Round 1 [Manager]
Questions:
- Introduction
- Discussion on one challenging task/project from previous organization.
- System design of how logging works in CI/CD (how logs are shown on GitHub/GitLab related to a job).
- Question: Given two operands and one operator and a result, design an efficient data structure to store the operands and write a merge function on it.
Candidate's Approach
After 20 minutes of thinking and with a hint, I was able to come up with a solution and coded it.
Interviewer's Feedback
No feedback provided.
Round 2 [VP of Engineering]
Questions:
- Introduction
- Behavioral question
- Discussion on one challenging task from previous organization.
- Question: You are given a singly-linked list with n nodes that you can only iterate through once at most. You are given additional space to store one node (i.e., a pointer to it). Devise an algorithm that can operate under these conditions, choose/select one node from the list such that the probability of each node being selected/chosen is equal.
I couldn't solve this question; I tried some methods, but in the end, it was not an acceptable answer.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.