Status: 2.10 YOE
Position: Backend Engineer 2
Location: Bangalore

Round 1: DSA

• Question 1: Easy question based on HashMaps. Similar to Two Sum: https://leetcode.com/problems/two-sum/
• Question 2: Given a list of strings, check if for any string, any of its permutations is divisible by 8. (Math trick: A number is divisible by 8 if its last 3 digits are divisible by 8. You just need to check permutations of combinations of 3 digits).
• Result: Discussed the approach and wrote the code. For the second question, the approach was agreed upon and I completed the code, couldn't run it for all test cases in interest of time.

Round 2: HLD

• Question: Design a test-taking platform (essentially, design HackerRank).
• The interviewer focused very heavily on the specific database schemas for codeStubs and testCases. They wanted a highly optimal structure for execution and storage.

Verdict: Rejected.