Agoda | SSE - Backend | Gurugram
Summary
I recently interviewed with Agoda for a Senior Software Engineer (Backend) role in Gurugram, India. After a recruiter screen, I completed a coding round successfully by solving two problems, and I am currently awaiting the results for the next steps.
Full Experience
Hi Fam,
I am currently an SSE at Walmart with 6.3 years of experience. I recently applied to Agoda for an SSE - Backend position in Gurugram through their careers website. The interview platform used for codepairing and interviews was Hackerrank.
Recruiter Phone Screen (15 min)
My journey started with a Recruiter Phone Screen which lasted about 15 minutes, conducted by a TA from Bangkok. During this screen, I was asked:- Why I was interested in Agoda.
- If I was willing to relocate to Gurgaon, and they mentioned they provide a relocation bonus.
- To give an introduction about myself.
Round #1 (Coding - 1 hour)
Next was Round #1, a Coding round, which was 1 hour long and conducted by a Staff Engineer from Bangkok. I was presented with two problems:- A variation of the LeetCode problem Eliminate Maximum Number of Monsters. The problem scenario involved airplanes instead of monsters. I approached and solved this using a Greedy strategy.
- The second problem involved calculating the total weight of a chemical formula. I was given the weights for three atoms: Carbon (C -> 12), Hydrogen (H -> 1), and Oxygen (O -> 8). For instance, CH4 would result in 16, and H(CH4)2 would be 33. I solved this problem using a Stack-based approach.
Interview Questions (2)
This was a variation of the LeetCode problem 'Eliminate Maximum Number of Monsters'. The problem scenario was rephrased to involve airplanes instead of monsters. The goal is likely to determine if it's possible to eliminate all incoming targets (airplanes) given their arrival times and speed, using a similar greedy approach as the original problem.
Given the weights of three specific atoms: Carbon (C -> 12), Hydrogen (H -> 1), and Oxygen (O -> 8). The task is to write a function that takes a chemical formula string as input and computes its total molecular weight. Examples provided were CH4 = 16, and H(CH4)2 = 33, indicating that nested structures with multipliers need to be handled.