Agoda Software Engineer interview questions

4 Software Engineers have shared notes from their Agoda interviews, with the questions they were asked in each round. That is 33% of the 12 Agoda interview notes on Screna AI.

4 Software Engineer interview notes

Agoda·Software Engineer·Technical Phone Screen

Jul 2026
Interviewed for a software engineer role at Agoda and got a classic array problem that felt straightforward until I started second-guessing myself on edge cases. Pretty standard coding round overall.
  • Given an integer array and a target value, find two distinct indices where the elements at those indices sum to the target. Return the indices, or an empty result if no such pair exists.

“I jumped straight to the hash map approach without asking about negatives or whether multiple valid answers were possible.”

View Post

Agoda·Software Engineer·Technical Phone Screen

Jun 2026
Had a software engineering interview at Agoda with two pretty different questions back to back. One was a classic DP problem, the other was a probability/simulation question that threw me a bit. Nothing about the experience felt particularly warm or cold, just technical.
  • Given a triangular array where each row has one more element than the last, find the minimum path sum from the top to the bottom. At each step you can move to the element directly below or one position to the right in the next row.
  • You have a 5-sided die and a 6-sided die. Each round you roll both. The process stops when at least one die shows 1. If only the 5-sided die shows 1 it wins, if only the 6-sided shows 1 it wins, and if both show 1 it's a tie. Find the probability that the 5-sided die wins, the expected number of rounds until stopping, and implement a Monte Carlo simulation to estimate both.

“Classic DP, and I knew it was DP pretty fast.”

View Post

Agoda·Software Engineer·Technical Phone Screen

Jun 2026
Agoda coding interview with a dynamic programming problem on triangle path sums. Pretty standard algorithmic question but still worth thinking through carefully before diving in.
  • Given a triangle represented as a 2D array, find the minimum path sum from the top to the bottom row, where at each step you can only move to adjacent numbers in the row below.

“Classic DP problem but I second-guessed myself on the adjacency definition for a bit.”

View Post

Agoda·Software Engineer·Technical Phone Screen

May 2026
Agoda software engineer interview that threw a probability puzzle at me. Not the LeetCode grind I was expecting, more of a math/reasoning problem that felt like it came out of nowhere.
  • Two people each arrive at a random time within a one-hour window. They meet only if their arrival times are within 15 minutes of each other. What is the probability they actually meet?

“I froze for a bit because I kept trying to think of it as a discrete problem.”

View Post