Agoda | SSE | Bangkok - Interview Experience
Summary
I applied through LinkedIn and successfully received an offer for a Senior Software Engineer position at Agoda in Bangkok after a 2-month interview process consisting of 6 rounds including technical coding, system design, behavioral, and HR discussions.
Full Experience
YOE: 8+ Years
Position: Senior Software Engineer (6+ Years) (Unicorn StartUp)
I applied through LinkedIn job and got an revert immediately within a week.
Round 1
HackerRank Test
- Problem 1: Medium Level Graph/Tree based question.
- Problem 2: Basic Http Request/Response handling question - need basic understanding of how the http request is made.
Round 2
Coding (Senior Engineer from Agoda) - Hackerrank Platform
- Problem 1: Variation of binary search/sorting.
- Problem 2: Variation of Jump Game (DP)
I had to explain the approach and write a working code with time and space complexity.
Round 3
Design Round with a Manager - HackerRank Platform
- Problem 1: Given a problem statement and partially completed design, you are supposed to give a complete HLD and tell what is the issue in the current design. Come up with APIs, similar to normal system design round.
- Problem 2: Given a code block and you have to understand the code and do a code review, checks how quickly you can understand the code and how do you review a code.
Round 4
Hiring Manager Round
- All possible behavioral questions can be asked and was asked, how do you handle team, pressure situation, time constraints, relocation etc.
Round 5
Non Eliminatory with the HR
- Friendly discussion with TA about the company expectations, budgets, feedbacks and offer related discussion.
Round 6
With my HR and the Hiring Manager
Dicussion around the offer and relocation and expectations, post this call got offer letter in 1 hour via mail.
Total time for whole process 2 months from the time I applied through LinkedIn to offer.
Compensation Details: Offer
Interview Questions (1)
Variation of Jump Game (DP)
A variation of the classic Jump Game problem, solved using Dynamic Programming. I had to explain the approach and write a working code with time and space complexity.