Akamai Technologies Application Developer Interview Questions and Answers

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between

• Handle leading, trailing, and multiple spaces appropriately
Answered by AI
Add your answer
Q2. 
Reverse a Stack Using Recursion
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...read more
Ans. 
Reverse a stack using recursion without using any extra space other than the internal stack space.
• Use recursion to pop all elements from the original stack and store them in function call stack.

• Once the stack is empty, push the elements back in reverse order.

• Base case of recursion should be when the original stack is empty.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

Q1. 
Convert a Binary Tree to its Mirror Tree
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...read more
Ans. 
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
• Traverse the binary tree in a recursive manner.

• Swap the left and right children of each non-leaf node.

• Continue this process until all nodes have been processed.
Answered by AI
Add your answer
Q2. 
Remove Nth Node from End of Linked List
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...read more
Ans. 
Remove the Kth node from the end of a singly linked list.
• Use two pointers approach to find the Kth node from the end.

• Handle edge cases like removing the head node or removing the last node.

• Update the pointers to remove the Kth node and reconnect the list.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical Managerial round.

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA, OOPS and puzzles.

Q1. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes until the end of the list is reached
Answered by AI
Add your answer
Q2. 
Reverse Number Problem Statement
Ninja is exploring new challenges and desires to reverse a given number. Your task is to assist Ninja in reversing the number provided.
Note:
If a number has trailing ze...read more
Ans. 
Implement a function to reverse a given number, omitting trailing zeros.
• Create a function that takes an integer as input and reverses it while omitting trailing zeros

• Use modulo and division operations to extract digits and reverse the number

• Handle cases where the reversed number has leading zeros by omitting them

• Ensure the reversed number is within the constraints specified
Answered by AI
Add your answer
Q3. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
Reverse a given string containing alphabets, numbers, and special characters.
• Iterate through the string from end to start and append each character to a new string.

• Use built-in functions like reverse() or slicing to reverse the string.

• Handle special characters and numbers while reversing the string.

• Ensure to consider the constraints provided in the problem statement.
Answered by AI
Add your answer
Q4. What is overloading in the context of Object-Oriented Programming (OOP)?
Ans. 
Overloading in OOP is the ability to define multiple methods with the same name but different parameters.
• Overloading allows multiple methods with the same name but different parameters to coexist in a class.

• The compiler determines which method to call based on the number and type of arguments passed.

• Example: having multiple constructors in a class with different parameter lists.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical round with question based on Web Dev, Cloud Computing, Networking etc.

Q1. What is TELNET?
Ans. 
TELNET is a network protocol used to establish a connection with a remote computer over a network.
• TELNET stands for Telecommunication Network.

• It allows a user to log in to a remote computer and execute commands as if they were directly connected to that computer.

• TELNET operates on port 23.

• It is not secure as the data is transmitted in plain text.

• SSH (Secure Shell) is a more secure alternative to TELNET.
Answered by AI
Add your answer
Q2. What is the difference between TELNET and SSH?
Ans. 
TELNET is insecure, while SSH is secure for remote access to servers.
• TELNET sends data in plain text, while SSH encrypts data for secure communication

• SSH uses public-key cryptography for authentication, TELNET does not

• SSH provides secure remote access to servers, TELNET does not prioritize security

• TELNET operates on port 23, while SSH operates on port 22
Answered by AI
Add your answer
Q3. 
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
Input:
The input sta...read more
Ans. 
Sort an array of 0s, 1s, and 2s in increasing order.
• Use a three-pointer approach to partition the array into sections of 0s, 1s, and 2s.

• Iterate through the array and swap elements based on their values.

• Time complexity should be O(n) to meet the constraints.
Answered by AI
Add your answer
Q4. What is a hypervisor?
Ans. 
A hypervisor is a software that creates and runs virtual machines on a physical host machine.
• Hypervisors allow multiple operating systems to run on a single physical machine

• They provide isolation between virtual machines

• Examples include VMware ESXi, Microsoft Hyper-V, and KVM
Answered by AI
Add your answer
Q5. Can you explain cloud computing in layman’s terms?
Ans. 
Cloud computing is like renting a computer over the internet instead of owning one.
• Cloud computing allows users to access and store data and applications over the internet instead of on their own physical computer.

• It offers scalability, flexibility, and cost-effectiveness as users can easily adjust their storage and computing needs.

• Examples include services like Amazon Web Services (AWS), Microsoft Azure, and Google Cl...read more
Answered by AI
Add your answer
Q6. What are the stages in the Software Development Life Cycle?
Ans. 
The stages in the Software Development Life Cycle include planning, design, development, testing, deployment, and maintenance.
• 1. Planning: Define project scope, requirements, and timelines.

• 2. Design: Create architecture, UI/UX, and database design.

• 3. Development: Write code based on design specifications.

• 4. Testing: Verify functionality, performance, and security.

• 5. Deployment: Release the software to users or clients.

• ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA and OOPS. A detailed discussion on my projects was also carried out.

Q1. 
Common Elements in Three Sorted Arrays
Given three sorted arrays A, B, and C of lengths N, M, and K respectively, your task is to find all elements that are present in all three arrays.
Input:
The first...read more
Ans. 
Find common elements in three sorted arrays and output them in order.
• Iterate through all three arrays simultaneously using three pointers.

• Compare elements at pointers and move pointers accordingly.

• If elements are equal, add to result and move all pointers forward.

• If elements are not equal, move pointer of smallest element forward.
Answered by AI
Add your answer
Q2. What is a volatile variable?
Ans. 
A volatile variable is a variable that can be modified by multiple threads simultaneously.
• Volatile variables are used in multithreading to ensure visibility of changes made by one thread to other threads.

• They are not cached in thread's local memory, but always read from main memory.

• They are typically used for flags or status variables that are accessed by multiple threads.

• Example: 'volatile boolean flag = true;'
Answered by AI
Add your answer
Q3. Can you explain the concept of multithreading in Java?
Ans. 
Multithreading in Java allows multiple threads to execute concurrently, improving performance and responsiveness.
• Multithreading allows multiple threads to run concurrently within a single process.

• Threads share the same memory space, allowing for efficient communication and data sharing.

• Java provides built-in support for multithreading through the Thread class and Runnable interface.

• Example: Creating a new thread using ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Round duration - 60 minutes
Round difficulty - Easy

Need to write working code on a shared document so that the interviewer can see if you can put your ideas into code. In this round, they are not bothered about time complexity of your algorithm. They just wanted to know if you can code whatever you think. So if you do not find best solution also it is OK but write the code for average case at-least.

Q1. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
Search for integers in a rotated sorted array efficiently.
• Use binary search to find the pivot point where the array is rotated.

• Based on the pivot point, apply binary search on the appropriate half of the array.

• Return the index of the integer if found, else return -1.

• Time complexity should be O(logN) for each query.
Answered by AI
Add your answer
Q2. 
Pair Sum in Binary Search Tree
Given a Binary Search Tree (BST) and a target value 'K', determine if there exist two unique elements in the BST such that their sum equals the target 'K'.
Explanation:
A ...read more
Ans. 
Check if there exist two unique elements in a BST that sum up to a target value 'K'.
• Traverse the BST in-order to get a sorted array of elements.

• Use two pointers approach to find the pair sum in the sorted array.

• Consider edge cases like duplicate elements or negative values.

• Time complexity can be optimized to O(n) using a HashSet to store visited nodes.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

I was interviewed for vcloud team so they asked me questions on Cloud, DSA etc.

Q1. 
Reverse List In K Groups Problem Statement
You are provided with a linked list having 'N' nodes and an integer 'K'. Your task is to reverse the linked list in groups of size K. If the list is numbered fro...read more
Ans. 
Reverse a linked list in groups of size K
• Iterate through the linked list in groups of size K

• Reverse each group of nodes

• Handle cases where the last group may have fewer than K nodes
Answered by AI
Add your answer
Q2. 
Reverse Stack with Recursion
Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...read more
Ans. 
Reverse a given stack of integers using recursion without using extra space or loops.
• Use recursion to pop all elements from the original stack and store them in function call stack

• Once the stack is empty, push the elements back in reverse order using recursion

• Use the top(), pop(), and push() methods to manipulate the stack
Answered by AI
Add your answer
Q3. What is cloud computing?
Ans. 
Cloud computing is the delivery of computing services over the internet, including storage, databases, networking, software, and more.
• Cloud computing allows users to access resources on-demand without the need for physical infrastructure.

• Examples of cloud computing services include Amazon Web Services (AWS), Microsoft Azure, and Google Cloud Platform.

• Cloud computing offers scalability, flexibility, cost-effectiveness, ...read more
Answered by AI
Add your answer
Q4. What are the benefits of cloud computing?
Ans. 
Cloud computing offers scalability, cost-efficiency, flexibility, and improved collaboration.
• Scalability: Easily scale resources up or down based on demand without the need for physical infrastructure.

• Cost-efficiency: Pay only for the resources you use, reducing upfront costs and maintenance expenses.

• Flexibility: Access data and applications from anywhere with an internet connection, enabling remote work and collaborat...read more
Answered by AI
Add your answer
Q5. What are the challenges of cloud computing?
Ans. 
Challenges of cloud computing include security concerns, data privacy issues, and potential downtime.
• Security concerns: Data breaches and unauthorized access are major risks in cloud computing.

• Data privacy issues: Ensuring compliance with regulations like GDPR can be challenging when data is stored in the cloud.

• Potential downtime: Dependence on internet connectivity and cloud service providers can lead to downtime affe...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
Reverse a given string containing alphabets, numbers, and special characters.
• Iterate through the string from the end to the beginning and append each character to a new string.

• Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

• Handle special characters and numbers along with alphabets while reversing the string.

• Ensure to consider the constraints on the number ...read more
Answered by AI
Add your answer
Q2. 
Flip Bits Problem Explanation
Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...read more
Ans. 
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
• Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

• Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.

• Update the maximum count of 1s if the current count is greater.

• Return the maximum count of 1s obtained after flipping a sub-array at most once...read more
Answered by AI
Add your answer
Q3. 
Check If Preorder Traversal Is Valid
Determine whether a given array ARR of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
A binary search tree (BST) is a tree structure w...read more
Ans. 
Check if a given array of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
• Create a function that takes the array as input and checks if it satisfies the properties of a BST preorder traversal.

• Iterate through the array and maintain a stack to keep track of the nodes in the BST.

• Compare each element with the top of the stack to ensure it follows the BST property.

• If the array is a valid preord...read more
Answered by AI
Add your answer
Q4. 
First and Last Position of an Element in a Sorted Array
Given a sorted array/list ARR consisting of ‘N’ elements, and an integer ‘K’, your task is to find the first and last occurrence of ‘K’ in ARR.
Exp...read more
Ans. 
Find the first and last occurrence of a given element in a sorted array.
• Use binary search to find the first occurrence of the element.

• Use binary search to find the last occurrence of the element.

• Handle cases where the element is not present in the array.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on DSA, OS, OOPS etc.

Q1. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal or not equal to find the intersection.

• Return the intersection as an array of common elements.
Answered by AI
Add your answer
Q2. 
Remove Duplicates From Unsorted Linked List Problem Statement
You are provided with a linked list consisting of N nodes. Your task is to remove duplicate nodes such that each element occurs only once in t...read more
Ans. 
Remove duplicates from an unsorted linked list while preserving the order of nodes.
• Iterate through the linked list while keeping track of seen elements using a hash set.

• If a duplicate element is encountered, skip it by adjusting the pointers.

• Ensure the order of nodes is preserved by only keeping the first occurrence of each element.
Answered by AI
Add your answer
Q3. What is the difference between paging and swapping in operating systems?
Ans. 
Paging is a memory management scheme that allows the operating system to store and retrieve data from secondary storage in fixed-size blocks, while swapping involves moving entire processes between main memory and disk.
• Paging involves dividing physical memory into fixed-size blocks called pages, while swapping involves moving entire processes between main memory and disk.

• Paging allows for more efficient use of physical...read more
Answered by AI
Add your answer
Q4. Can you provide an example of a deadlock in operating systems?
Ans. 
A deadlock in operating systems occurs when two or more processes are unable to proceed because each is waiting for the other to release a resource.
• Deadlock involves a circular wait, where each process is waiting for a resource held by another process in the cycle.

• Four necessary conditions for deadlock are mutual exclusion, hold and wait, no preemption, and circular wait.

• Example: Process A holds Resource 1 and waits fo...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA, OOPS and Puzzles.

Q1. 
Segregate Odd-Even Problem Statement
In a wedding ceremony at NinjaLand, attendees are blindfolded. People from the bride’s side hold odd numbers, while people from the groom’s side hold even numbers. For...read more
Ans. 
Rearrange a linked list such that odd numbers appear before even numbers while preserving the order of appearance.
• Iterate through the linked list and maintain two separate lists for odd and even numbers.

• Merge the two lists while preserving the order of appearance.

• Ensure to handle edge cases like empty list or list with only odd or even numbers.
Answered by AI
Add your answer
Q2. 
Convert Sorted Array to BST Problem Statement
Given a sorted array of length N, your task is to construct a balanced binary search tree (BST) from the array. If multiple balanced BSTs are possible, you ca...read more
Ans. 
Construct a balanced binary search tree from a sorted array.
• Create a function that recursively constructs a balanced BST from a sorted array.

• Use the middle element of the array as the root of the BST.

• Recursively build the left and right subtrees using the elements to the left and right of the middle element.

• Ensure that the left and right subtrees are also balanced BSTs.

• Return 1 if the constructed tree is correct, other...read more
Answered by AI
Add your answer
Q3. What is the difference between the MVC (Model-View-Controller) and MVT (Model-View-Template) design patterns?
Ans. 
MVC focuses on separating concerns of an application into three components, while MVT is a variation used in Django framework.
• MVC separates an application into Model (data), View (presentation), and Controller (logic) components.

• MVT is used in Django framework where Model represents data, View represents presentation, and Template represents logic.

• In MVC, the Controller handles user input and updates the Model and View...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.

Q1. 
Maximum Sum Path in a Binary Tree Problem Statement
You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...read more
Ans. 
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
• Traverse the binary tree to find all possible paths and calculate their sums.

• Keep track of the maximum sum encountered during traversal.

• Consider paths that may include the same node twice.

• Implement a recursive function to explore all possible paths.

• Handle cases where nodes have negative values.
Answered by AI
Add your answer
Q2. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal, and update the intersection array.

• Return the intersection array as the result.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.

Q1. 
Next Greater Element Problem Statement
You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...read more
Ans. 
Find the Next Greater Element for each element in an array.
• Iterate through the array from right to left

• Use a stack to keep track of elements with no greater element to the right

• Pop elements from the stack until finding a greater element or stack is empty
Answered by AI
Add your answer
Q2. 
Number In Arithmetic Progression Problem
Given three integers X, C, and Y, where X is the first term of an arithmetic sequence with a common difference of C, determine if Y is part of this arithmetic sequ...read more
Ans. 
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
• Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C

• Check if Y is equal to any term in the sequence to determine if it belongs to the sequence

• Return 'True' if Y belongs to the sequence, otherwise return 'False'
Answered by AI
Add your answer
Q3. Can you define process and threads in operating systems?
Ans. 
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
• A process is a program in execution, consisting of code, data, and resources.

• Threads are smaller units within a process that can execute independently.

• Processes have their own memory space, while threads share the same memory space within a process.

• Processes are heavyweight, while threads ar...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

Q1. 
Max Product Subset Problem Statement
Given an array/list arr of size n, determine the maximum product possible by taking any subset of the array/list arr. Return the result modulo 10^9+7 since the product ...read more
Ans. 
Find the maximum product of a subset of an array modulo 10^9+7.
• Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.

• Handle cases where the array contains zeros separately.

• Return the maximum product modulo 10^9+7.
Answered by AI
Add your answer
Q2. 
Populating Next Right Pointers in Each Node
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
...read more
Ans. 
Implement a function to update 'next' pointers in a complete binary tree.
• Iterate level by level using a queue

• Connect nodes at each level using 'next' pointers

• Handle null nodes appropriately

• Ensure the tree is a complete binary tree
Answered by AI
Add your answer
Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.

Q1. 
Stack with getMin Operation
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...read more
Ans. 
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
• Use two stacks - one to store the actual elements and another to store the minimum element at each level.

• When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.

• When popping an element, also pop from the minimum stack if the popped element is t...read more
Answered by AI
Add your answer
Q2. 
Split Array Into Maximum Subarrays Problem Statement
You are given an integer array arr of size N. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...read more
Ans. 
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
• Iterate through the array and keep track of the first and last occurrence of each element.

• Use a hashmap to store the indices of each element.

• Split the array whenever the last occurrence of an element is found.
Answered by AI
Add your answer