Akamai 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Akamai Placement Papers 2024
Overview
Section titled “Overview”This page collects Akamai placement papers from 2024 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 2024 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 2024
Section titled “Akamai exam pattern 2024”| 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 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2024)
Section titled “Quantitative aptitude (2024)”Q1: Series n(n+1)
Problem: Find the next term: 2, 6, 12, 20, 30, ?
Solution: Pattern: 1×2, 2×3, 3×4, 4×5, 5×6, 6×7. Next = 6 × 7 = 42.
Answer: 42
Q2: Deck probability
Problem: What is the probability of drawing an ace from a standard 52-card deck?
Solution: There are 4 aces in 52 cards. Probability = 4/52 = 1/13.
Answer: 1/13
Q3: Net percent change
Problem: A number is increased by 20% and then decreased by 20%. What is the net percentage change?
Solution: Start with 100 → 120 → 96. Net change = 4% decrease. Formula: successive +a then −a gives −(a²/100)% = −4%.
Answer: 4% decrease
Q4: Consumption cut
Problem: If the price of an item rises by 25%, by what percent should consumption fall so that expenditure stays the same?
Solution: Required reduction = r/(100+r) × 100 with r = 25. = 25/125 × 100 = 20%.
Answer: 20%
Q5: Compound mark-discount
Problem: An article is marked 40% above cost and sold after a 10% discount. Find the profit percent.
Solution: SP = CP × 1.4 × 0.9 = 1.26 CP. Profit = 26%.
Answer: 26%
Q6: Loss to profit shift
Problem: An article sold at 10% loss would give 5% profit if sold for ₹60 more. Find the cost price.
Solution: 0.9P + 60 = 1.05P 60 = 0.15P P = 60 / 0.15 = ₹400.
Answer: ₹400
Q7: Worker scaling
Problem: Eight workers finish a job in 10 days. How many days will 10 workers take for the same job (same pace)?
Solution: Total man-days = 8 × 10 = 80. Days for 10 workers = 80 / 10 = 8 days.
Answer: 8 days
Q8: Distance from speed
Problem: A vehicle travels at 60 km/h for 2.5 hours. How far does it go?
Solution: Distance = speed × time = 60 × 2.5 = 150 km.
Answer: 150 km
Coding practice (2024)
Section titled “Coding practice (2024)”Coding Q1: 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 Q2: 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 Q3: 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 Q4: 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 Q5: 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 Q6: 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 Q7: 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.
Coding Q8: Top K frequent elements
Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.
Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.
Complexity: O(n log k) with a heap
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 2024 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