44 curated coding interview questions directly asked in Agoda technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 726 | Number of Atoms | Hard | Core DSA | Implementation / Reasoning | 65.1% | 100.0% | 3m |
| 1011 | Capacity To Ship Packages Within D Days | Medium | Binary Search | Binary Search | 73.9% | 100.0% | 3m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 100.0% | all |
| 1921 | Eliminate Maximum Number of Monsters | Medium | Arrays | Sorting / Prefix / Scan | 51.1% | 87.5% | 3m |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 87.5% | 3m |
| 3893 | Maximum Team Size with Overlapping Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.6% | 87.5% | 3m |
| 1200 | Minimum Absolute Difference | Easy | Arrays | Sorting / Prefix / Scan | 75.1% | 87.5% | 6m |
| 3178 | Find the Child Who Has the Ball After K Seconds | Easy | Core DSA | Implementation / Reasoning | 62.1% | 87.5% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 87.5% | all |
| 3787 | Find Diameter Endpoints of a Tree | Medium | Trees; Dynamic Programming | DFS / BFS; State Transition | 68.2% | 87.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 75.0% | 6m |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 75.0% | all |
| 63 | Unique Paths II | Medium | Core DSA | Implementation / Reasoning | 44.5% | 75.0% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 62.5% | 6m |
| 1331 | Rank Transform of an Array | Easy | Arrays | Sorting / Prefix / Scan | 70.9% | 62.5% | 6m |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 62.5% | 6m |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 62.5% | 6m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 62.5% | all |
| 1636 | Sort Array by Increasing Frequency | Easy | Arrays | Sorting / Prefix / Scan | 80.8% | 62.5% | all |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | Core DSA | Implementation / Reasoning | 65.9% | 62.5% | all |
| 844 | Backspace String Compare | Easy | Strings | Hashing / Sliding Window | 49.9% | 62.5% | all |
| 724 | Find Pivot Index | Easy | Core DSA | Implementation / Reasoning | 62.7% | 62.5% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 62.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 120 | Triangle | Medium | Core DSA | Implementation / Reasoning | 59.9% | 50.0% | all |
| 2734 | Lexicographically Smallest String After Substring Operation | Medium | Strings; Trees; Graphs | Hashing / Sliding Window; DFS / BFS; BFS / DFS / Topological Sort | 34.9% | 50.0% | all |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.0% | 50.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 50.0% | all |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 50.0% | all |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 50.0% | all |
| 977 | Squares of a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 73.8% | 50.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 713 | Subarray Product Less Than K | Medium | Arrays | Sorting / Prefix / Scan | 54.3% | 50.0% | all |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 50.0% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 50.0% | all |
| 412 | Fizz Buzz | Easy | Core DSA | Implementation / Reasoning | 75.5% | 50.0% | all |
| 1048 | Longest String Chain | Medium | Strings | Hashing / Sliding Window | 63.0% | 50.0% | all |
| 767 | Reorganize String | Medium | Strings | Hashing / Sliding Window | 57.1% | 50.0% | all |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 50.0% | all |
| 1071 | Greatest Common Divisor of Strings | Easy | Strings | Hashing / Sliding Window | 53.8% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 50.0% | all |
| 122 | Best Time to Buy and Sell Stock II | Medium | Core DSA | Implementation / Reasoning | 71.1% | 50.0% | all |