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
- #70easyoccasionally asked
70. Climbing Stairs
Count the distinct ways to climb n stairs taking 1 or 2 steps at a time. Akamai uses this as an entry point into dynamic programming — the recurrence relation is immediately applicable to retry-strategy combinatorics and caching policy analysis.
- #704easyoccasionally asked
704. Binary Search
Search a sorted array for a target value in O(log n) time. Akamai uses binary search as a litmus for algorithmic correctness — the off-by-one bug in the loop condition is the same class of error that causes out-of-bound reads in high-performance C++ networking code.