Skip to content

Spotify Placement Papers 2024

Overview

This page collects Spotify 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 Spotify patterns and recent shifts.

Spotify 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

Spotify 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: Spotify Online Assessment
Skills emphasized: DSA, distributed systems, backend
Languages: Java, Python, Scala

Sample Spotify questions with solutions

These are practice-style questions aligned to patterns students report for Spotify 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: 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

Q2: 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%

Q3: 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%

Q4: 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

Q5: 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

Q6: 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

Q7: Compound ratio

Problem: If two ratios are 3:5 and 5:7, what is the compound ratio?

Solution: Compound ratio = (3/5) × (5/7) = 3/7, written as 3:7.

Answer: 3:7

Q8: SI three years

Problem: Find simple interest on ₹5000 at 8% per annum for 3 years.

Solution: SI = 5000 × 8 × 3 / 100 = ₹1200.

Answer: ₹1200

Coding practice (2024)

Coding Q1: Rotate array

Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].

Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.

Complexity: O(n) time, O(1) 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.

Coding Q2: First unique character

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.

Coding Q3: 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

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.

Coding Q4: 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

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.

Coding Q5: 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

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.

Coding Q6: 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

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.

Coding Q7: 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

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.

Coding Q8: 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

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.

Deep prep notes for Spotify

How the Spotify 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 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.

Topic weight hints

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

14-Day sprint

  1. Days 1-3: Learn the 2024 pattern and take two sectional mocks
  2. Days 4-7: Closed practice on weak topics from your error log
  3. Days 8-10: Full mocks every other day; review the same day
  4. Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready

Comments & Suggestions

Similar companies

Netflix · Uber · Google · Meta