Leetcode forum helped a lot to prepare for this, so here I am giving back to the community.
Hackerrank Round (2 Hours)
2 Questions (LC Easy-Medium)
Solved both.
Tip: I would insist you go ahead and check all possible corner cases. All given cases passing in sample test case doesn't imply its the right submission.
Telephonic Round on Coderpad - I (1 hour)
2 Questions (LC Medium-Hard) - Josephus problem, A variation of 0-1 Knapsack Problem
Solved Josephus problem with ease. Coding second one took a while. Although interviewer was satisfied with my approach, second code was breaking at few cases. We both tried debugging the code for those few cases but time ran out.
Tip: Beside solving problem interviewer pushed me to find corner cases, or cases where code may break.
Telephonic Round on Coderpad - II (1 hour)
Note that usually there is only one telephonic round. I felt this one was easier than previous one.
Question 1: Scalar product of two vectors. Question was easy but they drilled on the Java part, like exception handling, input handling (null vector, or null inside vector), etc. I did okay.
Question 2: Highest average score. Explained here. Probably most frequently asked question in GS interview.
Tip: Besides test cases they also drilled on other java concepts and time complexities. Specially with second one, how hashmap was reducing time complexity, etc.
Zoom + CoderPad Rounds (4 Rounds - 1 hour each)
Each round had 2 interviewers. One would ask some LC Medium-Hard questions, while other one with something specific to that round (mentioned below).
Round 1 - Data Structure
Round 2 - System Design
Round 3 - Java (Java Collections, Spring/Springboot, Class concepts)
Round 4 - About me, previous projects etc.
Few questions I can recall -
- DIstance between two nodes in BST (Explained here)
- Optimally shuffle a list of songs. My solution was in O(n).
Got offer after 2-3 working days. Salary details are more or less similar to what's there on glassdoor.