Akamai Coding Interview Questions
25 Akamai coding interview problems with full optimal solutions — 8 easy, 12 medium, 5 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Akamai interviewer values, and a FAQ section.
Showing 2 problems of 25
- #4hardoccasionally asked
4. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log(m+n)) time. Akamai asks this to test binary search mastery at its hardest — computing the p50 latency across two sorted measurement arrays without merging them maps directly to how distributed edge performance dashboards aggregate data from multiple regions.
- #127hardoccasionally asked
127. Word Ladder
Find the shortest transformation sequence from one word to another changing one letter at a time. Akamai ties this to BFS in routing graphs — finding the minimum number of hops between two network states where each hop changes exactly one configuration parameter is the same shortest-path problem on an implicit graph.