Akamai 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
Akamai Placement Papers 2025
Overview
Section titled “Overview”This page collects Akamai placement papers from 2025 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established Akamai patterns and recent shifts.
Download / jump links
Section titled “Download / jump links”Akamai 2025 coding
DSA practice aligned to Akamai online assessments
Akamai interview experience
Round structure and tips from student reports
Akamai prep guide
Study plan and weekly schedule
Akamai Aptitude Mock Quiz
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Questions15
Time10 min
Quantitative
The LCM of 12 and 18 is:
LCM(12,18) = 36.
Quantitative
Find the compound interest on ₹5000 for 2 years at 10% per annum, compounded annually.
Correct answer: ₹1050
Quantitative
A number when divided by 5 leaves remainder 3. What is remainder when twice the number is divided by 5?
n = 5k+3 → 2n = 10k+6 = 5(2k+1)+1 → remainder 1.
Verbal
Choose correctly spelled word:
Correct spelling is Necessary.
Quantitative
If the price of a commodity increases by 25% and then decreases by 20%, what is the net change in price?
Correct answer: No change (0%)
Reasoning
Find the next number: 3, 9, 27, 81, ?
×3 each → 243.
Reasoning
In a row of 40 students, A is 11th from left. Rank from right is:
From right = 40 − 11 + 1 = 30.
Verbal
A person who loves books is a:
Correct term: Bibliophile.
Reasoning
A is taller than B but shorter than C. D is shorter than B. Who is tallest?
C > A > B > D → C is tallest.
Verbal
The company's profits have been _____ steadily over the past year.
Correct answer: declining
Reasoning
Statements: All birds can fly. Penguins are birds. Conclusion: Penguins can fly. Is the conclusion valid?
Correct answer: Invalid (first premise is false)
Quantitative
If all managers are leaders, and some leaders are innovators, which of the following must be true?
From "All managers are leaders" and "Some leaders are innovators", we can conclude that "Some innovators are managers" (c)
Reasoning
Find the next number: 2, 6, 12, 20, 30, ?
Differences +4, +6, +8, +10, +12 → next is 42.
Verbal
Problem: "She is good _____ mathematics." a) at b) in c) on d) with
"Good at" is the correct prepositional phrase for skills.
Quantitative
A car covers 180 km in 3 hours. Average speed is:
Speed = 180/3 = 60 km/h.
Your score
0/15(0%)
Review
Akamai exam pattern 2025
Section titled “Akamai exam pattern 2025”| Section | What shows up | Prep focus |
|---|---|---|
| Online assessment | Coding and/or MCQ filter | Weekly timed mocks |
| Technical rounds | DSA, CS fundamentals, projects | Live problem solving |
| HR / hiring manager | Motivation and communication | Specific, evidence-based answers |
First round: Akamai Online Assessment
Skills emphasized: DSA, networking, distributed systems
Languages: C, C++, Java, Python
Sample Akamai questions with solutions
Section titled “Sample Akamai questions with solutions”These are practice-style questions aligned to patterns students report for Akamai drives around 2025. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2025)
Section titled “Quantitative aptitude (2025)”Q1: Sum of naturals
Problem: What is the sum of the first 50 natural numbers?
Solution: Sum of first n naturals = n(n+1)/2. For n = 50: 50 × 51 / 2 = 1275.
Answer: 1275
Q2: Average speed
Problem: A person covers a distance at 60 km/h and returns at 40 km/h. What is the average speed for the whole trip?
Solution: For equal distances, average speed = 2ab/(a+b). = 2×60×40 / (60+40) = 4800/100 = 48 km/h.
Do not take the arithmetic mean (50); that would be wrong here.
Answer: 48 km/h
Q3: Marked price discount
Problem: A shopkeeper marks goods 20% above cost and then gives a 10% discount. What is the profit percentage?
Solution: Let CP = ₹100. Marked price = ₹120. Discount = 10% of 120 = ₹12. SP = 120 − 12 = ₹108. Profit % = 8%.
Answer: 8%
Q4: Three workers
Problem: A finishes work in 12 days, B in 15 days, and C in 20 days. Working together, how many days do they need?
Solution: Take total work = LCM(12,15,20) = 60 units. A = 5/day, B = 4/day, C = 3/day. Combined = 12 units/day. Time = 60/12 = 5 days.
Answer: 5 days
Q5: Age ratio
Problem: The ratio of ages of A and B is 3:5. After 8 years the ratio becomes 5:7. Find A’s present age.
Solution: Let ages be 3x and 5x. (3x+8)/(5x+8) = 5/7 7(3x+8) = 5(5x+8) 21x + 56 = 25x + 40 4x = 16 → x = 4 A’s age = 12 years.
Answer: 12 years
Q6: Pipe fill
Problem: Pipe A fills a tank in 6 hours and pipe B in 8 hours. How long do they take together to fill it?
Solution: Combined rate = 1/6 + 1/8 = 4/24 + 3/24 = 7/24. Time = 24/7 hours ≈ 3 hours 26 minutes.
Answer: 24/7 hours
Q7: Simple interest
Problem: Find the simple interest on ₹8000 at 10% per annum for 2 years.
Solution: SI = (P × R × T) / 100 = (8000 × 10 × 2) / 100 = ₹1600.
Answer: ₹1600
Q8: Percentage recover
Problem: If 30% of a number is 150, what is the number?
Solution: 0.3x = 150 → x = 150 / 0.3 = 500.
Answer: 500
Coding practice (2025)
Section titled “Coding practice (2025)”Coding Q1: Stack with min
Problem: Design a stack that supports push, pop, top, and getMin in average O(1) time.
Approach: Keep a parallel min-stack (or store pairs). When pushing, also push the new minimum. When popping, pop both stacks.
Complexity: O(1) per operation amortized
Akamai tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Maximum subarray sum (Kadane)
Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).
Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.
Complexity: O(n) time, O(1) extra space
Akamai tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Reverse a string in place
Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.
Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.
Complexity: O(n) time, O(1) extra space
Akamai tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Check prime
Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.
Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.
Complexity: O(√n) time
Akamai tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q5: Valid parentheses
Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.
Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.
Complexity: O(n) time, O(n) space
Akamai tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q6: Two Sum
Problem: Given an array of integers and a target, return indices of two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.
Approach: Walk the array once. For each value x, check whether target − x was seen earlier in a hash map of value → index. If yes, return both indices; else store x.
Complexity: O(n) time, O(n) space
Akamai tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q7: Longest substring without repeating characters
Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).
Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.
Complexity: O(n) time
Akamai tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q8: Merge overlapping intervals
Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.
Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.
Complexity: O(n log n) time from the sort
Akamai tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Deep prep notes for Akamai
Section titled “Deep prep notes for Akamai”How the Akamai Online Assessment usually feels
Section titled “How the Akamai Online Assessment usually feels”Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Akamai, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: C, C++, Java, Python.
Topic weight hints
Section titled “Topic weight hints”| Area | Why it matters at Akamai |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| CDN, Cloud Security awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
14-Day sprint
Section titled “14-Day sprint”- Days 1-3: Learn the 2025 pattern and take two sectional mocks
- Days 4-7: Closed practice on weak topics from your error log
- Days 8-10: Full mocks every other day; review the same day
- Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready