The interview process involved several rounds:

First round: Online assessment with one easy/medium LeetCode-style coding problem and one SQL Server join question.

Second round: Virtual coding challenge with one developer.

After clearing these two rounds, there was an onsite interview with four different teams:

1. Manager: This round was primarily behavioral and technical, focusing on high-level concepts.
2. Frontend interview: Conducted by two people, this focused on Angular and JavaScript questions, along with one coding challenge.
3. Backend interview: A panel of two people presented a coding challenge, which I completed using C# and it was a medium LeetCode-style problem.
4. QA: This involved a general chat about the overall QA process. The communication was very easy and not particularly interesting.

My understanding is that proficiency in LeetCode/HackerRank is crucial for clearing this interview process. I successfully solved all coding challenges and performed well in most rounds, except for the frontend interview. Given my recent 2.5 years of experience in backend development, they ultimately selected a candidate with a stronger frontend background, as they were seeking a frontend-heavy profile.

Given a string [2,5?4], find if 4 is in between 2 and 5, inclusive. Expected answer: true. [2,5?7] - false.

For ]2,5?5[, the value after the question mark, 5, must be present inside the range 2,5 excluding 2 and 5 (i.e., 3,4). Since 5 is not within 3,4, the output is false.

[2,5?5] - true [2,5?2] - true [2,5?6] - false ]2,5?5[ - false ]2,5?2[ - false ]2,5?3[ - true

JavaScript - Frontend

Given a list of arrays, find if two values add up to a given target value. Arr: [2,3,4,5,6,7,8], Target: 10 Output: True

Follow-up question: Do it in O(1) performance.

Given a string, find the number of times a given target is repeated. String: “abcddbcdcddcd”, Find String: “cd” Output: 4

This can get tricky; try to cover all kinds of test cases.