Spotify 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
This page collects Spotify 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 Spotify patterns and recent shifts.
Spotify 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
Spotify 2025 coding
DSA practice aligned to Spotify online assessments
Spotify interview experience
Round structure and tips from student reports
Spotify prep guide
Study plan and weekly schedule
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Verbal
Fill: Neither the teacher nor the students _____ present.
With neither…nor, verb agrees with nearer subject (students) → were.
Quantitative
Two numbers are in ratio 3:5 and their sum is 56. The larger number is:
Parts = 8. Larger = 5/8 × 56 = 35.
Quantitative
Simple interest on ₹5,000 at 8% p.a. for 3 years is:
SI = PRT/100 = 5000×8×3/100 = ₹1,200.
Reasoning
Complete the series: AZ, BY, CX, ?
First letter +1, second −1 → DW.
Verbal
Choose the correct sentence:
Neither takes singular verb; "options" is plural noun with of.
Reasoning
In a row of 40 students, A is 11th from left. Rank from right is:
From right = 40 − 11 + 1 = 30.
Quantitative
A shopkeeper offers two successive discounts of 20% and 15%. What is the effective discount percentage?
Correct answer: 32%
Verbal
Synonym of "Abundant":
Abundant means plentiful.
Quantitative
A train 150 meters long passes a platform 200 meters long in 20 seconds. Find the speed of the train in km/hr.
Total distance = 150 + 200 = 350 meters Time = 20 seconds Speed = 350/20 = 17.5 m/s Speed in km/hr = 17.5 × 18/5 = 63 km/hr
Reasoning
Find the missing number: 3, 7, 15, 31, 63, ?
Correct answer: 127
Reasoning
Series: 3, 7, 15, 31, 63, ?
×2+1 pattern: 63×2+1 = 127.
Quantitative
A person travels first half of distance at 40 km/hr and second half at 60 km/hr. Find average speed.
Let total distance = 2D Time for first half = D/40 Time for second half = D/60 Total time = D/40 + D/60 = D(3+2)/120 = 5D/120 = D/24 Average speed = 2D / (D/24) = 48 km/hr
Reasoning
If BOOK is coded as 43 (sum of letter positions), PEN is coded as:
P+E+N = 16+5+14 = 35.
Quantitative
The LCM of 12 and 18 is:
LCM(12,18) = 36.
Verbal
Synonym of "Modest":
Modest means humble.
Your score
0/15(0%)
| 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: Spotify Online Assessment
Skills emphasized: DSA, distributed systems, backend
Languages: Java, Python, Scala
These are practice-style questions aligned to patterns students report for Spotify drives around 2025. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Problem: Find simple interest on ₹5000 at 8% per annum for 3 years.
Solution: SI = 5000 × 8 × 3 / 100 = ₹1200.
Answer: ₹1200
Problem: A boat’s speed in still water is 15 km/h and the stream is 3 km/h. How long to cover 36 km upstream?
Solution: Upstream speed = 15 − 3 = 12 km/h. Time = 36 / 12 = 3 hours.
Answer: 3 hours
Problem: A mixture has milk and water in the ratio 4:1. If 5 litres of water are added to 20 litres of mixture, what is the new milk:water ratio?
Solution: In 20 L: milk = 16 L, water = 4 L. After adding 5 L water: milk 16, water 9. Ratio = 16:9.
Answer: 16:9
Problem: Find compound interest on ₹10,000 at 10% per annum for 2 years, compounded annually.
Solution: Amount = 10000 × (1.1)² = 10000 × 1.21 = ₹12,100. CI = 12100 − 10000 = ₹2100. (SI for same period would be ₹2000; the extra ₹100 is interest on first-year interest.)
Answer: ₹2100
Problem: What is the angle between the hour and minute hands at 3:00?
Solution: At 3:00 the hands are exactly 90° apart (one quarter of the circle).
Answer: 90°
Problem: In how many ways can 5 different books be arranged on a shelf?
Solution: Arrangements of 5 distinct items = 5! = 120.
Answer: 120
Problem: If the sum of three consecutive integers is 72, what is the smallest of these integers?
Solution: Let the integers be x, x+1, and x+2.
x + (x+1) + (x+2) = 72 3x + 3 = 72 3x = 69 x = 23
So the integers are 23, 24, and 25.
Answer: 23
Problem: A train 150 meters long passes a pole in 15 seconds. What is its speed in km/h?
Solution: Distance = 150 m = 0.15 km. Time = 15 s = 15/3600 h = 1/240 h. Speed = 0.15 ÷ (1/240) = 0.15 × 240 = 36 km/h.
Faster check: 150/15 = 10 m/s → 10 × 18/5 = 36 km/h.
Answer: 36 km/h
Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.
Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.
Complexity: O(n) time
Spotify 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.
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
Spotify 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.
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
Spotify 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.
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
Spotify 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.
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
Spotify 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.
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
Spotify 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.
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
Spotify 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.
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
Spotify 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.
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Spotify, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, Scala.
| Area | Why it matters at Spotify |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Audio Streaming awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |