cswork / libraryOpen practice workspace

Interview guides · Iheartmedia

Iheartmedia Software Engineer Interview Guide

Iheartmedia Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

A Software Engineer at Iheartmedia works at the intersection of media, entertainment, and cutting-edge technology. As the leading audio company in the United States, Iheartmedia delivers multi-platform music, news, podcasts, and sports content to hundreds of millions of listeners. Software engineers here do not just write code; they build and scale the critical infrastructure that powers live audio streaming, content distribution networks, digital ad-tech engines, and internal broadcast operations tools. In this role, your work directly impacts millions of active users who rely on seamless audio delivery across web, mobile, smart speakers, and automotive integrations.

This guide is scoped to a Software Engineer candidate at Iheartmedia.

Focus areas

  • System Design
  • Live Coding
  • Concurrency

The Iheartmedia interview process

Iheartmedia candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Recruiter Phone Screen

Initial call focusing on your background, career goals, and alignment with the role's requirements.

What to demonstrate

  • Initial call focusing on your background, career goals, and alignment with the role's requirements
  • Depth in System Design

How to prepare

  • Be able to walk your CV end to end in two minutes, and say why this company specifically.
  • Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.

Technical Screening

Live coding assessment or technical conversation with an engineering manager to evaluate coding and problem-solving skills.

What to demonstrate

  • Live coding assessment or technical conversation with an engineering manager to evaluate coding and problem-solving skills
  • Depth in System Design

How to prepare

  • Answer aloud and timed: Given a sample block of code, identify all potential bugs, memory leaks, or logical errors printed on the page.
  • Answer aloud and timed: Write a function to reverse a linked list both iteratively and recursively.

Comprehensive Virtual Loop

Four-hour session divided into focused evaluations of system design, computer science fundamentals, language expertise, and behavioral alignment.

What to demonstrate

  • Four-hour session divided into focused evaluations of system design, computer science fundamentals, language expertise, and behavioral alignment
  • Depth in System Design

How to prepare

  • Answer aloud and timed: How would you optimize a search algorithm to run in logarithmic time on a sorted dataset?
  • Answer aloud and timed: Explain how the Java Virtual Machine (JVM) manages memory, specifically focusing on garbage collection and heap vs. stack allocation.

Where candidates lose points

Expect some redundancy across rounds

Candidates often report that different interviewers in the loop may ask similar questions about your background or technical choices. Treat every round with equal energy and consistency, ensuring you explain your projects with the same level of detail and enthusiasm each time.

When discussing past projects, use the STAR method (Situation, Task, Action, Result) to structure your answers

Quantify your achievements wherever possible, such as "reduced API latency by 20%" or "scaled stream processing to handle 50k concurrent events."

Proactively manage your follow-ups

Recruitment pipelines at large media organizations can sometimes experience administrative bottlenecks. If you encounter a period of silence after a positive round, do not hesitate to reach out to your coordinator. Proactivity is often viewed positively as a sign of strong interest.

Questions & practice

Implement a function to find all duplicate elements in an array and return them in order of their first appear

Medium · Computer Science Basics & Coding

Implement a function to find all duplicate elements in an array and return them in order of their first appearance.

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Explain the difference between a hash map and a binary search tree, and discuss the time complexity of their p

Medium · Computer Science Basics & Coding

Explain the difference between a hash map and a binary search tree, and discuss the time complexity of their primary operations.

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Given a sample block of code, identify all potential bugs, memory leaks, or logical errors printed on the page

Medium · Computer Science Basics & Coding

Given a sample block of code, identify all potential bugs, memory leaks, or logical errors printed on the page.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Write a function to reverse a linked list both iteratively and recursively.

Medium · Computer Science Basics & Coding

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

How would you optimize a search algorithm to run in logarithmic time on a sorted dataset?

Medium · Computer Science Basics & Coding

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Explain how the Java Virtual Machine (JVM) manages memory, specifically focusing on garbage collection and hea

Medium · Concurrency & Language Specifics

Explain how the Java Virtual Machine (JVM) manages memory, specifically focusing on garbage collection and heap vs. stack allocation.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

How do you handle thread safety and prevent race conditions when writing concurrent code in Scala or Java?

Medium · Concurrency & Language Specifics

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

What are the advantages of functional programming paradigms in Scala when building highly concurrent data pipe

Medium · Concurrency & Language Specifics

What are the advantages of functional programming paradigms in Scala when building highly concurrent data pipelines?

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Describe the lifecycle of a React component and how you would optimize a component to prevent unnecessary re-r

Medium · Concurrency & Language Specifics

Describe the lifecycle of a React component and how you would optimize a component to prevent unnecessary re-renders.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.

Approach

  1. Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
  2. Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
  3. Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
  4. State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.

Follow-up

  • A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
  • The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?

Write the update path that detects a concurrent edit

Medium · optimistic concurrency · transactional outbox · audit history

resource carries version INT NOT NULL DEFAULT 1. resource_revision holds revision_id, resource_id, version, actor_user_id, change_kind, patch JSONB, request_id, created_at with UNIQUE (resource_id, version). outbox_event holds aggregate_type, aggregate_id, aggregate_version, event_type, payload, status. A PUT carries the version the client read. Write the exact statements for the single transaction that applies the edit, records the revision and enqueues 'resource.updated', and give the handler's branch on zero affected rows. Then say what PostgreSQL 16 does under READ COMMITTED when two of these updates hit one row at once.

Approach

  1. One transaction, three writes, no network call inside it: UPDATE resource SET title = $3, version = version + 1, updated_at = now() WHERE resource_id = $1 AND tenant_id = $4 AND version = $2; then INSERT the resource_revision row at version $2 + 1; then INSERT the outbox_event row at the same aggregate_version. The event goes to a table rather than a broker because no transaction spans both.
  2. Branch on the affected-row count before doing anything else. Zero has three causes — stale version, wrong tenant, row gone — so re-read once and map to 409 carrying the current version, or 404 for an id outside the caller's tenant, which also stops the endpoint confirming that another tenant's id exists.
  3. State the engine behaviour instead of assuming it. Under READ COMMITTED the second UPDATE blocks on the row lock, and when the first commits PostgreSQL re-evaluates the WHERE clause against the newly committed row, so the version predicate now fails and the statement reports zero rows. Under REPEATABLE READ the identical collision raises SQLSTATE 40001 instead, so the handler must fold both shapes into one conflict response.
  4. Keep UNIQUE (resource_id, version) even though the predicate already serialises writers. It is what makes a lost update unwritable if any other path ever reaches the revision table, and it converts a logic bug into 23505 rather than into a silently missing history row.

Follow-up

  • A client sends the version it read ten minutes ago and the resource has moved three versions. What is in your 409 so it can resolve the conflict without a full re-fetch?
  • Two editors, two disjoint fields, no overlap. Does your answer still refuse the second write, and should it?

In React, how do you manage complex application state, and when would you choose Context API over a state mana

Medium · Concurrency & Language Specifics

In React, how do you manage complex application state, and when would you choose Context API over a state management library?

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

  • What happens if the caller retries after a timeout?
  • How does a client discover it is on an old version of this contract?

Design a high-throughput audio streaming service that can scale to support millions of concurrent listeners du

Medium · System Design & Scalability

Design a high-throughput audio streaming service that can scale to support millions of concurrent listeners during peak hours.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

How would you design a distributed caching layer to reduce latency for a metadata service powering radio stati

Medium · System Design & Scalability

How would you design a distributed caching layer to reduce latency for a metadata service powering radio station schedules?

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Describe how you would build a fault-tolerant message queue system to handle real-time listener interaction da

Medium · System Design & Scalability

Describe how you would build a fault-tolerant message queue system to handle real-time listener interaction data.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

What strategies would you implement to ensure data consistency across multiple microservices in a distributed

Medium · System Design & Scalability

What strategies would you implement to ensure data consistency across multiple microservices in a distributed environment?

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

How do you approach database sharding and replication for a system that stores user playlists and listening hi

Medium · System Design & Scalability

How do you approach database sharding and replication for a system that stores user playlists and listening history?

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

One customer endpoint stalls deliveries to every other destination

Medium · bulkhead · timeouts · saturation

The egress service delivers about 1.5k webhooks/second across 40,000 destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. Throughput falls to 300/second, queue depth climbs, and p99 delivery latency for unaffected destinations goes from 200 ms to minutes, while the error rate barely moves. One tenant holds 900 destination rows whose URLs share a hostname that now answers in 9.5 seconds. Explain the mechanism with the arithmetic, then give the containment in the order you would apply it.

Approach

  1. Look at saturation before errors. A flat error rate with collapsing throughput says nothing is failing, things are waiting, so the first signal to pull is in-flight request count or pool wait time rather than the error counter. This is the distinction that decides the whole investigation.
  2. Group in-flight work by resolved host, not by destination id. The cap is keyed per destination row, so 900 rows sharing one hostname buy 3,600 concurrent slots against a single host, each held for 9.5 seconds. The bulkhead was never a bulkhead for that host, and grouping by the wrong dimension is why the dashboard looked healthy.
  3. Do the arithmetic in both directions. Required concurrency is arrival rate times latency, so 1.5k/second at 200 ms needs about 300 in flight, which is entirely consumed by 3,600 slow slots; conversely whatever concurrency is left sustains rate equals concurrency divided by 9.5 seconds, which is the 300/second you are seeing. Matching both numbers is what promotes this from a plausible story to the mechanism.
  4. Explain why the circuit breaker never helped. It opens on consecutive failures, and a 9.5-second response inside a 10-second timeout is a success. Slow is not failing, so an error-rate breaker cannot see this; you need a slow-call ratio, a deadline propagated from the caller's remaining budget, or a concurrency limiter.

Follow-up

  • The host recovers to 80 ms. How long does the queue take to drain, and what does the drain do to the recovered host?
  • Where should the 10-second timeout number actually come from?

Suggested practice checklist

Built from the rounds and topics Iheartmedia candidates report.

Day 1 — Map the Iheartmedia loop

  • Write out the reported sequence: Recruiter Phone Screen, Technical Screening, Comprehensive Virtual Loop.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.

Day 2 — Work System Design

  • Spend the session on System Design, which Iheartmedia candidates report being tested on.
  • Write one worked example in System Design and time yourself on it.

Deliverable: One timed worked example in System Design.

Day 3 — Work Live Coding

  • Spend the session on Live Coding, which Iheartmedia candidates report being tested on.
  • Write one worked example in Live Coding and time yourself on it.

Deliverable: One timed worked example in Live Coding.

Day 4 — Work Concurrency

  • Spend the session on Concurrency, which Iheartmedia candidates report being tested on.
  • Write one worked example in Concurrency and time yourself on it.

Deliverable: One timed worked example in Concurrency.

Day 5 — Answer out loud: Computer Science Basics & Coding

  • Answer aloud, timed: Implement a function to find all duplicate elements in an array and return them in order of their first appearance.
  • Answer aloud, timed: Explain the difference between a hash map and a binary search tree, and discuss the time complexity of their primary operations.

Deliverable: Spoken answers to 2 reported Computer Science Basics & Coding question(s), under time.

Day 6 — Answer out loud: Concurrency & Language Specifics

  • Answer aloud, timed: Explain how the Java Virtual Machine (JVM) manages memory, specifically focusing on garbage collection and heap vs. stack allocation.
  • Answer aloud, timed: How do you handle thread safety and prevent race conditions when writing concurrent code in Scala or Java?

Deliverable: Spoken answers to 2 reported Concurrency & Language Specifics question(s), under time.

Day 7 — Answer out loud: System Design & Scalability

  • Answer aloud, timed: Design a high-throughput audio streaming service that can scale to support millions of concurrent listeners during peak hours.
  • Answer aloud, timed: How would you design a distributed caching layer to reduce latency for a metadata service powering radio station schedules?

Deliverable: Spoken answers to 2 reported System Design & Scalability question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

Describe a time when you had to resolve a technical disagreement with another engineer on your team. What was

Medium · Behavioral & Culture Fit

Describe a time when you had to resolve a technical disagreement with another engineer on your team. What was the outcome?

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

How do you handle a situation where product requirements change mid-way through a development sprint?

Medium · Behavioral & Culture Fit

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Tell me about a complex technical problem you solved in a past project. How did you identify the root cause, a

Medium · Behavioral & Culture Fit

Tell me about a complex technical problem you solved in a past project. How did you identify the root cause, and what did you learn?

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

How do you balance the pressure to deliver features quickly with the need to maintain high code quality and re

Medium · Behavioral & Culture Fit

How do you balance the pressure to deliver features quickly with the need to maintain high code quality and reduce technical debt?

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Why are you interested in working in the audio and media streaming industry, and why Iheartmedia specifically?

Medium · Behavioral & Culture Fit

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?