Agoda coding interview
questions, leaked.
40 problems reported across recent Agoda interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Agoda's online assessment hits you with 40 problems across two hours, mostly medium-difficulty array and string work. You'll see 3Sum, House Robber, Longest Substring Without Repeating Characters, and Daily Temperatures on rotation. The good news: 35 of the 40 are easy or medium, so the bar is pattern recognition, not algorithm invention. The bad news: array problems alone make up 68% of the question pool. You need deep fluency in two-pointers, prefix sums, and sliding windows before you sit down. If you blank mid-assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds, so you don't crater on a problem you've actually drilled.
Top problems at Agoda
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | 3Sum | MEDIUM | 100.0 | 37% | Array · Two Pointers · Sorting |
| 02 | Best Time to Buy and Sell Stock | EASY | 95.5 | 55% | Array · Dynamic Programming |
| 03 | Find the Child Who Has the Ball After K Seconds | EASY | 95.5 | 62% | Math · Simulation |
| 04 | Capacity To Ship Packages Within D Days | MEDIUM | 92.9 | 72% | Array · Binary Search |
| 05 | Longest Substring Without Repeating Characters | MEDIUM | 90.0 | 37% | Hash Table · String · Sliding Window |
| 06 | Daily Temperatures | MEDIUM | 82.9 | 67% | Array · Stack · Monotonic Stack |
| 07 | Minimum Absolute Difference | EASY | 82.9 | 71% | Array · Sorting |
| 08 | Unique Paths II | MEDIUM | 82.9 | 43% | Array · Dynamic Programming · Matrix |
| 09 | House Robber | MEDIUM | 72.9 | 52% | Array · Dynamic Programming |
| 10 | Backspace String Compare | EASY | 65.8 | 49% | Two Pointers · String · Stack |
| 11 | Find Pivot Index | EASY | 65.8 | 61% | Array · Prefix Sum |
| 12 | Minimum Window Substring | HARD | 65.8 | 45% | Hash Table · String · Sliding Window |
| 13 | Coin Change | MEDIUM | 65.8 | 46% | Array · Dynamic Programming · Breadth-First Search |
| 14 | Triangle | MEDIUM | 65.8 | 59% | Array · Dynamic Programming |
| 15 | Brick Wall | MEDIUM | 65.8 | 56% | Array · Hash Table |
| 16 | Integer to Roman | MEDIUM | 65.8 | 69% | Hash Table · Math · String |
| 17 | Find the Smallest Divisor Given a Threshold | MEDIUM | 55.9 | 64% | Array · Binary Search |
| 18 | Reverse Substrings Between Each Pair of Parentheses | MEDIUM | 55.9 | 72% | String · Stack |
| 19 | Merge Intervals | MEDIUM | 55.9 | 49% | Array · Sorting |
| 20 | Squares of a Sorted Array | EASY | 55.9 | 73% | Array · Two Pointers · Sorting |
| 21 | Insert Delete GetRandom O(1) | MEDIUM | 55.9 | 55% | Array · Hash Table · Math |
| 22 | Permutation in String | MEDIUM | 55.9 | 47% | Hash Table · Two Pointers · String |
| 23 | Decode String | MEDIUM | 55.9 | 61% | String · Stack · Recursion |
| 24 | Two Sum | EASY | 55.9 | 56% | Array · Hash Table |
| 25 | Can Place Flowers | EASY | 55.9 | 29% | Array · Greedy |
| 26 | Lexicographically Smallest String After Substring Operation | MEDIUM | 55.9 | 32% | String · Greedy |
| 27 | Move Zeroes | EASY | 55.9 | 63% | Array · Two Pointers |
| 28 | Sort Array by Increasing Frequency | EASY | 55.9 | 80% | Array · Hash Table · Sorting |
| 29 | Longest Palindromic Substring | MEDIUM | 55.9 | 36% | Two Pointers · String · Dynamic Programming |
| 30 | Kth Smallest Element in a BST | MEDIUM | 55.9 | 75% | Tree · Depth-First Search · Binary Search Tree |
| 31 | Valid Parentheses | EASY | 55.9 | 42% | String · Stack |
| 32 | Jump Game II | MEDIUM | 55.9 | 42% | Array · Dynamic Programming · Greedy |
| 33 | Find Median from Data Stream | HARD | 55.9 | 53% | Two Pointers · Design · Sorting |
| 34 | Plus One | EASY | 55.9 | 48% | Array · Math |
| 35 | Group Anagrams | MEDIUM | 55.9 | 71% | Array · Hash Table · String |
| 36 | Next Greater Element I | EASY | 55.9 | 75% | Array · Hash Table · Stack |
| 37 | Subarray Product Less Than K | MEDIUM | 55.9 | 53% | Array · Binary Search · Sliding Window |
| 38 | Merge Sorted Array | EASY | 55.9 | 53% | Array · Two Pointers · Sorting |
| 39 | Best Time to Buy and Sell Stock II | MEDIUM | 55.9 | 70% | Array · Dynamic Programming · Greedy |
| 40 | Eliminate Maximum Number of Monsters | MEDIUM | 55.9 | 51% | Array · Greedy · Sorting |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Agoda OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array27 · 68%
- string11 · 28%
- hash table10 · 25%
- sorting9 · 23%
- dynamic programming8 · 20%
- two pointers8 · 20%
- stack6 · 15%
- greedy5 · 13%
- sliding window4 · 10%
- math4 · 10%
Array dominance is the story here. 27 out of 40 problems touch arrays, and that includes dynamic-programming grid problems, monotonic-stack work, and two-pointer patterns. String shows up in 11 problems, almost always paired with hash tables or sliding windows. Hash tables anchor the tougher substring and window-sliding questions. Dynamic programming is medium-depth: House Robber, Coin Change, Unique Paths II, and Triangle are bread-and-butter DP, not hard combinatorics. Two-pointers and sorting matter for 3Sum and absolute-difference problems. Stack appears in Daily Temperatures and stack-simulation questions. Drill arrays first, then nail sliding-window patterns on strings. Dynamic programming and two-pointers are your next tier. If you hit a wall on a DP formulation or forget how to track two pointers in a sorted array during the live OA, StealthCoder is your hedge.
Companies with similar patterns
If you prepped for Agoda, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Agoda.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Agoda interview FAQ
What should I study first for Agoda?+
Array fundamentals. They show up in 27 of 40 problems. Pair that with two-pointers (3Sum, Backspace String Compare) and sliding-window patterns on strings (Longest Substring Without Repeating Characters, Minimum Window Substring). Nail those three patterns before touching anything else.
Is dynamic programming heavy on Agoda's assessment?+
No. DP appears in 8 problems out of 40, and they're all classic patterns: House Robber, Coin Change, Unique Paths II, Triangle. These are pattern-match problems, not hard derivations. Treat them as your third tier after arrays and two-pointers.
How much time should I spend on hash tables?+
Hash tables appear in 10 problems, usually paired with strings or sliding windows. They're not the primary focus. Spend your time on array and string drills first. Hash tables become relevant once you're confident in Longest Substring Without Repeating Characters and Minimum Window Substring.
Will I see hard problems on Agoda's OA?+
Only 2 out of 40 problems are hard-difficulty. Agoda's assessment leans medium and easy. Minimum Window Substring is the hardest; it combines hash tables, strings, and sliding windows. Master that pattern and the rest is safer ground.
Should I memorize sorting algorithms?+
Sorting matters in 9 problems, but you don't need to code your own sort. Know how to use built-in sorts and when to apply them. 3Sum and Minimum Absolute Difference both rely on sorted arrays. Understand the pattern, not the algorithm itself.