Linkedin 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Linkedin Placement Papers 2024
Overview
This page collects LinkedIn 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 LinkedIn patterns and recent shifts.
Download / jump links
Linkedin 2024 coding
DSA practice aligned to LinkedIn online assessments
Linkedin interview experience
Round structure and tips from student reports
Linkedin prep guide
Study plan and weekly schedule
LinkedIn 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
A car covers 240 km in 4 hours. What is its average speed?
Correct answer: 60 km/hr
Reasoning
If letter positions are summed (A=1…Z=26), RED equals:
Sum of positions = 27.
Quantitative
The HCF of 36 and 48 is:
36 = 2²×3², 48 = 2⁴×3 → HCF = 2²×3 = 12.
Quantitative
A is twice as old as B. 10 years ago, A was 4 times as old as B. Find the present age of A.
Correct answer: 30 years
Quantitative
If "APPLE" is coded as "1225165", how is "MANGO" coded?
Pattern: A=1, B=2, C=3... Z=26 APPLE: A=1, P=16, P=16, L=12, E=5 → 1225165 MANGO: M=13, A=1, N=14, G=7, O=15 → 13114715
Verbal
Fill in: She is good _____ mathematics.
Good at a subject.
Quantitative
A number is first increased by 25% and then decreased by 20%. Find the net percentage change.
Let number = 100 After 25% increase: 100 + 25 = 125 After 20% decrease: 125 - 20% of 125 = 125 - 25 = 100 Net change = 0%
Verbal
The company's profits have been _____ steadily over the past year.
Correct answer: declining
Reasoning
In a row of 40 students, A is 11th from the left. Rank from the right is:
From right = 40-11+1 = 30.
Verbal
The idiom "add fuel to the fire" means:
It means: make a situation worse.
Reasoning
If every letter is shifted +2 in the alphabet, CODE becomes:
Each letter +2 → EQFG.
Verbal
Antonym of "Optimistic":
Optimistic ↔ pessimistic.
Quantitative
A sum of money amounts to ₹9800 after 5 years and ₹12005 after 8 years at the same rate of simple interest. Find the rate of interest per annum.
Let Principal = P, Rate = R% After 5 years: P + (P × R × 5)/100 = 9800 After 8 years: P + (P × R × 8)/100 = 12005 Subtracting: (P × R × 3)/100 = 12005 - 9800 = 2205 P × R = 73500 From first equation: P + (73500 × 5)/100 = 9800 P + 3675 = 9800 P = 6125 Rate R =
Reasoning
In how many ways can 5 people be arranged in a row if two particular people must sit together?
Treat the two people as one unit: 4 units to arrange = 4! ways The two people can be arranged among themselves in 2! ways Total = 4! × 2! = 24 × 2 = 48 ways
Reasoning
All dogs are animals. All animals need food. Conclusion: All dogs need food.
Transitive universal.
Your score
0/15(0%)
Review
Linkedin 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: LinkedIn Online Assessment
Skills emphasized: DSA, system design, product sense
Languages: Java, C++, Python
Sample Linkedin questions with solutions
These are practice-style questions aligned to patterns students report for LinkedIn 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)
Q1: 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%
Q2: 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
Q3: 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
Q4: 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
Q5: 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
Q6: 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
Q7: Average after replace
Problem: The average of five numbers is 20. One number 30 is replaced by 10. What is the new average?
Solution: Old sum = 5 × 20 = 100. New sum = 100 − 30 + 10 = 80. New average = 80 / 5 = 16.
Answer: 16
Q8: 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
Coding practice (2024)
Coding Q1: 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
LinkedIn 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: 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
LinkedIn 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: 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
LinkedIn 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: 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
LinkedIn 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: 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
LinkedIn 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: Linked list cycle
Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.
Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.
Complexity: O(n) time, O(1) space
LinkedIn 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: Binary tree level order
Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.
Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.
Complexity: O(n) time, O(n) space
LinkedIn 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: Coin change (min coins)
Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.
Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.
Complexity: O(amount × coins)
LinkedIn 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 Linkedin
How the Linkedin 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 LinkedIn, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, C++, Python.
Topic weight hints
| Area | Why it matters at LinkedIn |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Professional Network, SaaS awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
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