Akamai Interview Questions

Note: ensure you read the disclaimer on the previous page reading the accuracy and sourcing of these problems.

Levenshtein Edit Distance

An edit distance is a way to quantify how different two strings are. This is calculated using **the minimum number of transformations to turn one string to another**. The transformations include insertion , deletion , and substitution . So when comparing two identical strings, say cat and ca...

Difficulty: 7/10

The Two Coloring Graph Problem

Question Given a graph, can you use two colors to color each node of the graph, such that no two adjacent nodes have the same color? The Problem The graph coloring problem is a well known problem in computer science. It requires coloring different nodes of the graph so that two adj...

Difficulty: 6/10

How Many Strongly Connected

Given a directed graph lessons simple reference to graphs represented via an adjacency list, write a class StronglyConnectedComponents with a count method that would return the number of strongly connected components in a graph. The definition of a strong connected component is a subgr...

Difficulty: 8/10

Implement a Graph

Since a graph lessons simple reference to graphs is one of the more difficult data structures to conceptualize in a programmatic 2D manner, let's go ahead and implement it! We'll go with an adjacency list version. Note that there's also the adjacency matrix method which we will cover later....

Difficulty: 4/10

Traverse a Matrix in Spiral Order

Given an m * n matrix array, can you print all its elements in a spiral order as shown in the figure below? Try to use only O 1 space! Constraints Total elements in the matrix 100000 The values in the matrix ranges from 1000000000 and 1000000000 Expected time complexity :...

Difficulty: 7/10

Design A Least Recently Used (LRU) Cache

A cache pronounced cash is a place of storage that allows for faster data retrieval. Separate from the main data storage, it's usually faster memory that houses frequently accessed values. With a cache in place, when a client application needs to access data, it'll check the cache first befo...

Difficulty: 7/10

Two Sum from BST

This problem is a fun combination of the famous Two Sum problem combined with a binary search lessons binary search technique tree. Given the root of a binary search lessons binary search technique tree, and a target integer K , return true if there exist two nodes in the said tree...

Difficulty: 7/10

Merge Intervals

This is a classic interview question that is used in _a lot_ in technical interviews, frequently in the form of a calendar or meeting management application. As such, we'll also assume the same use case, as it's easier to visualize. Suppose we're given a few arrays, like 1, 4 , 2, 5 , 7,...

Difficulty: 5/10

Serialize and Deserialize a Binary Tree

Given a binary tree representation, can you come up with a method to serialize the tree and then deserialize it to get the exact same tree? What is Serialization and Deserialization? Serialization is a process that converts a data structure to a suitable format that can be stored either ...

Difficulty: 8/10

[CDN Case Study] Akamai Summary and Architecture

Unpacking the Akamai Network: A Cornerstone of Modern Internet Infrastructure _This is a summary of the original Akaimai Network whitepaper, which can be found at this link https: github.com papers we love papers we love blob master distributed_systems the akamai network.pdf _. The Essenc...

Difficulty: 5/10

Mastering Recursion

Still generating... This lesson is currently still being generated, please wait... thanks! **Please refresh in a minute or two to see updates.** ...

Difficulty: 5/10

Data Structures and Algorithms

Introduction to Data Structures and Algorithms In the world of software development, the concepts of data structures and algorithms play a crucial role in solving problems efficiently. Data structures are like containers that organize and store data in a specific format, allowing easy access an...

Difficulty: 5/10