Starts off with screening of CV/Resume
I did not have a degree, but job experience ~5 years, so I passed this stage.
Leet code interview: 2 questions; if completed, bonus question 3
Could not complete it in time. but the interviewee was nice, You can apply again aftert 6 months cooldown period
LeetCode 1921 — “Eliminate Maximum Number of Monsters.” It is essentially the same problem as a turret defending a base from incoming planes/enemies.
You are given something like:
distance = [1, 3, 4] speed = [1, 1, 1]
Each plane/enemy moves toward your base at a constant speed. Your turret can destroy one target per unit of time. The trick is to calculate when each target reaches the base:
arrival time = distance / speed
Then sort by arrival time and shoot the earliest-arriving target first.
For example:
Plane Distance Speed Arrival A 8 4 2 B 6 1 6 C 9 3 3 D 4 4 1
Sorted by arrival:
D -> A -> C -> B 1 2 3 6
The following metrics were computed from 1 interview experience for the Agoda Full Stack Engineer role in Bangkok, Thailand.
Agoda's interview process for their Full Stack Engineer roles in Bangkok, Thailand is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Agoda's Full Stack Engineer interview process in Bangkok, Thailand.