Akamai coding interview
questions, leaked.
7 problems reported across recent Akamai interviews. Top patterns: array, hash table, dynamic programming. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Akamai's coding assessment hits you with array and hash-table problems almost every time. Out of 7 reported problems, 6 are array-based and 4 touch hash tables. The difficulty curve is forgiving: 4 easy, 2 medium, 1 hard. But that hard problem, Median of Two Sorted Arrays, requires binary search and divide-and-conquer thinking that catches people off guard. If you blank mid-assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds. But you still want to nail the easy wins first.
Top problems at Akamai
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | N-Repeated Element in Size 2N Array | EASY | 100.0 | 77% | Array · Hash Table |
| 02 | Best Time to Buy and Sell Stock | EASY | 72.2 | 55% | Array · Dynamic Programming |
| 03 | Two Sum | EASY | 62.9 | 56% | Array · Hash Table |
| 04 | Median of Two Sorted Arrays | HARD | 62.9 | 44% | Array · Binary Search · Divide and Conquer |
| 05 | Construct Binary Search Tree from Preorder Traversal | MEDIUM | 62.9 | 83% | Array · Stack · Tree |
| 06 | Longest Palindrome | EASY | 62.9 | 56% | Hash Table · String · Greedy |
| 07 | Pairs of Songs With Total Durations Divisible by 60 | MEDIUM | 62.9 | 53% | Array · Hash Table · Counting |
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 Akamai OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array6 · 86%
- hash table4 · 57%
- dynamic programming1 · 14%
- binary search1 · 14%
- divide and conquer1 · 14%
- stack1 · 14%
- tree1 · 14%
- binary search tree1 · 14%
- monotonic stack1 · 14%
- binary tree1 · 14%
The pattern is clear: Akamai loves array manipulation paired with hash-table lookups. Two Sum, N-Repeated Element, and Pairs of Songs are all variations on the same idea: scan an array and use a hash table to find matches. That's your warm-up tier. Best Time to Buy and Sell Stock introduces dynamic programming but stays straightforward. The medium problems add complexity: one requires monotonic-stack thinking on a binary search tree, the other demands fast counting via hash tables. The hard outlier, Median of Two Sorted Arrays, is the test's actual teeth. It forces you to binary-search across two arrays simultaneously. Most candidates know arrays and hashing cold, so your edge is recognizing when to binary-search instead of iterate. StealthCoder is your hedge if the hard problem lands and you freeze on the search bounds.
Companies with similar patterns
If you prepped for Akamai, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Akamai.
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 Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Akamai interview FAQ
Should I prioritize hash tables or arrays for Akamai prep?+
Both, but together. Six of seven problems use arrays. Four use hash tables. You won't see one without the other. Study them as a pair: array iteration plus hash-table lookup is the core pattern. Median of Two Sorted Arrays is the outlier that rewards binary-search knowledge.
Is dynamic programming weighted heavily in Akamai interviews?+
No. Only one reported problem touches DP, and it's the easy version: Best Time to Buy and Sell Stock. DP isn't the focus here. Master arrays and hashing first, then pick up binary search for the hard problem.
How much time should I spend on the hard problem versus easy ones?+
Easy problems are 57 percent of the reported set. Nail those first. They're your points. The hard problem is one outlier. Practice Median of Two Sorted Arrays last, after you've owned Two Sum, N-Repeated Element, and the stock problem.
What's the difference between hash-table and array problems here?+
Hash tables appear in counting and lookup tasks: find duplicates, match pairs, check frequencies. Arrays appear in everything: iteration, two-pointers, sorting, binary search. The hard problem uses both: binary search on arrays to find the median. They're inseparable.
Is monotonic stack important for passing Akamai?+
It appears once, in Construct Binary Search Tree from Preorder Traversal. That's medium difficulty. If you've solved stack problems before, you'll recognize the pattern. If not, it's one edge case to know. Master arrays and hashing first.