Webmd Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Webmd plays a critical role in developing, scaling, and maintaining the digital infrastructure that powers one of the world's most trusted health information platforms. Engineers here work on high-impact products that reach millions of monthly active users, including public-facing health portals, provider directories, and enterprise-level wellness platforms like Webmd Health Services. Your work directly influences how patients, healthcare professionals, and corporate partners access vital health data, requiring an uncompromising commitment to performance, security, and uptime. In this role, you will navigate a diverse technical landscape.

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

Focus areas

• Algorithms
• Data Structures
• Problem Solving

The Webmd interview process

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

Recruiter Phone Screen

Initial discussion with a recruiter to evaluate your background and fit for the role.

What to demonstrate

• Initial discussion with a recruiter to evaluate your background and fit for the role
• Depth in Algorithms

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.

Online Technical Assessment

Candidates complete an online assessment to evaluate technical skills.

What to demonstrate

• Candidates complete an online assessment to evaluate technical skills
• Depth in Algorithms

How to prepare

• Answer aloud and timed: Write an algorithm to reverse an array or manipulate elements based on specific index rules.
• Answer aloud and timed: How would you swap two integers ($x = 5, y = 10$ to $x = 10, y = 5$) without using a temporary variable?

Technical Rounds

Multiple technical interviews focusing on practical coding and database fundamentals.

What to demonstrate

• Multiple technical interviews focusing on practical coding and database fundamentals
• Depth in Algorithms

How to prepare

• Answer aloud and timed: Write a program to find the length of the longest common subsequence between two strings.
• Answer aloud and timed: Implement a bubble sort algorithm and explain how you can optimize it for nearly sorted arrays.

Comprehensive Panel Interview

Final interview stage involving a panel that assesses technical and behavioral alignment.

What to demonstrate

• Final interview stage involving a panel that assesses technical and behavioral alignment
• Depth in Algorithms

How to prepare

• Answer aloud and timed: What are the differences between a Monolithic architecture and Microservices, and how do you decide when to transition?
• Answer aloud and timed: Explain the difference between UNION and UNION ALL in SQL, and when you would use each.

Where candidates lose points

Prepare for Tight Offer Windows

Webmd is known to sometimes issue offers with very short expiration dates (e.g., 2 days). If you are navigating multiple interview pipelines, try to align your timelines so you can make an informed decision without feeling pressured.

Do not hesitate to ask for clarification on offer details immediately upon receipt

If you need an extension to align with other opportunities, communicate your request professionally, but be aware that some recruiters may enforce rigid deadlines.

Master the Flowchart

Do not just write code; practice drawing it. Being able to quickly map out an array manipulation or a search algorithm as a clean, logical flowchart on a virtual whiteboard is a major differentiator in their technical rounds.

Emphasize Your Database Knowledge

Database queries and schema design are heavily tested at Webmd. Ensure you brush up on SQL fundamentals, indexing, and the differences between relational database operations.

Questions & practice

Write a program to print the nth Fibonacci number and explain its time complexity.

Medium · Coding & Algorithms

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?

Implement an algorithm to determine if a given string or number is a palindrome.

Medium · Coding & Algorithms

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?

Write an algorithm to reverse an array or manipulate elements based on specific index rules.

Medium · Coding & Algorithms

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 swap two integers ($x = 5, y = 10$ to $x = 10, y = 5$) without using a temporary variable?

Medium · Coding & Algorithms

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?

Write a program to find the length of the longest common subsequence between two strings.

Medium · Coding & Algorithms

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?

Implement a bubble sort algorithm and explain how you can optimize it for nearly sorted arrays.

Medium · Coding & Algorithms

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 UNION and UNION ALL in SQL, and when you would use each.

Medium · System Design & Databases

Approach

1. Name the grain you start from and join outward from it.
2. Check whether any join is one-to-many before aggregating, or the sums inflate.
3. Say which index the query would use, and what makes it unusable.
4. Handle the rows that do not match: that is usually the actual question.

Follow-up

• How does the query change if that join becomes one-to-many?
• What happens to this when the table is ten times larger?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

• 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
• A dashboard runs this for 40 owners in one page load. What changes about the design?

What are the differences between a Monolithic architecture and Microservices, and how do you decide when to tr

Medium · System Design & Databases

What are the differences between a Monolithic architecture and Microservices, and how do you decide when to transition?

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 document upload system? Walk through the database schema and the overall API flow.

Medium · System Design & Databases

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?

Explain the differences between a Stored Procedure and a Function in a relational database.

Medium · System Design & Databases

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 performance tuning for slow-running APIs or database queries?

Medium · System Design & Databases

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 implement a rate limiter to protect public-facing APIs from abuse.

Medium · System Design & Databases

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?

Explain the concept of Redux to a non-technical stakeholder or a developer who has never used it.

Medium · Frontend & Web Technologies

Approach

1. Clarify what is being asked and what a complete answer contains.
2. State your assumptions explicitly before working the problem.
3. Say what you would check first and why it is the highest-information step.
4. Work from the requirement backwards to the design.

Follow-up

• What assumption would you test first?
• How would you know your answer was wrong?

What are the key architectural differences between Reflux and Redux, and what are the challenges of migrating

Medium · Frontend & Web Technologies

What are the key architectural differences between Reflux and Redux, and what are the challenges of migrating a live application between them?

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 optimize frontend rendering performance and reduce page load times for high-traffic content sites?

Medium · Frontend & Web Technologies

Approach

1. Clarify what is being asked and what a complete answer contains.
2. State your assumptions explicitly before working the problem.
3. Say what you would check first and why it is the highest-information step.
4. Work from the requirement backwards to the design.

Follow-up

• What assumption would you test first?
• How would you know your answer was wrong?

Explain how event delegation works in JavaScript and why it is useful.

Medium · Frontend & Web Technologies

Approach

1. Clarify what is being asked and what a complete answer contains.
2. State your assumptions explicitly before working the problem.
3. Say what you would check first and why it is the highest-information step.
4. Work from the requirement backwards to the design.

Follow-up

• What assumption would you test first?
• How would you know your answer was wrong?

p99 jumped on one listing filter while p50 stayed flat

Medium · query planning · composite index · percentiles

After a release that added an owner_user_id filter to the resource listing, p99 rose from 90 ms to 1.9 s while p50 stayed at 40 ms. Traffic and row counts are unchanged. resource carries the index (tenant_id, status, updated_at DESC, resource_id DESC). The new query filters tenant_id and owner_user_id, orders by updated_at DESC, resource_id DESC, and takes 20 rows. On PostgreSQL, explain the shape of the regression, prove it from a query plan, and give the index you would add.

Approach

1. Start from the shape. A flat p50 with a moved p99 means a subset of requests changed cost, not all of them, so the first job is naming the subset. Bucket the endpoint's latency by the tenant's row count; the natural hypothesis is that large tenants are a small share of requests and all of the tail.
2. Get the plan for the new query on a large tenant with EXPLAIN (ANALYZE, BUFFERS). Expect an index scan over the tenant's range, a filter discarding most of it, then a Sort feeding the Limit, possibly reporting Sort Method: external merge Disk. Read actual rows on the scan node, not estimated.
3. Explain why the existing index cannot serve it. A composite B-tree is seekable only as a left prefix, and with no equality predicate on status the scan cannot treat updated_at as an ordering, because rows in the tenant's range are ordered by status first. Everything matching must be read and sorted before LIMIT 20 can apply, so a tenant with 400,000 rows pays 400,000 rows to return 20.
4. Add (tenant_id, owner_user_id, updated_at DESC, resource_id DESC). Equality on the first two columns leaves the index ordered by updated_at within that pair, so the plan becomes an index scan that stops after 20 rows with no Sort node. PostgreSQL can scan a B-tree backwards, so the DESC markers matter only if the two sort columns ever disagree in direction; keeping them explicit documents the order the keyset cursor depends on.

Follow-up

• The endpoint paginates with OFFSET. What does page 500 cost with your index, and what does the keyset version cost?
• How would you have caught this before release, given that a 10,000-row seed database produces the same plan shape at an unnoticeable cost?

Suggested practice checklist

Built from the rounds and topics Webmd candidates report.

Day 1 — Map the Webmd loop

• Write out the reported sequence: Recruiter Phone Screen, Online Technical Assessment, Technical Rounds, Comprehensive Panel Interview.
• 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 4 reported rounds, with the weakest marked.

Day 2 — Work Algorithms

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

Deliverable: One timed worked example in Algorithms.

Day 3 — Work Data Structures

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

Deliverable: One timed worked example in Data Structures.

Day 4 — Work Problem Solving

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

Deliverable: One timed worked example in Problem Solving.

Day 5 — Answer out loud: Coding & Algorithms

• Answer aloud, timed: Write a program to print the nth Fibonacci number and explain its time complexity.
• Answer aloud, timed: Implement an algorithm to determine if a given string or number is a palindrome.

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

Day 6 — Answer out loud: System Design & Databases

• Answer aloud, timed: What are the differences between a Monolithic architecture and Microservices, and how do you decide when to transition?
• Answer aloud, timed: Explain the difference between UNION and UNION ALL in SQL, and when you would use each.

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

Day 7 — Answer out loud: Frontend & Web Technologies

• Answer aloud, timed: Explain the concept of Redux to a non-technical stakeholder or a developer who has never used it.
• Answer aloud, timed: What are the key architectural differences between Reflux and Redux, and what are the challenges of migrating a live application between them?

Deliverable: Spoken answers to 2 reported Frontend & Web Technologies question(s), under time.

Behavioural preparation

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

Describe a highly complex program or feature you wrote in a previous role. How did you structure the code, and

Medium · Behavioral & Scenario-Based

Describe a highly complex program or feature you wrote in a previous role. How did you structure the code, and what challenges did you overcome?

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 being on-call, and can you share an experience where you had to resolve a critical productio

Medium · Behavioral & Scenario-Based

How do you handle being on-call, and can you share an experience where you had to resolve a critical production outage under pressure?

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 time you disagreed with a technical decision made by a lead or architect. How did you resolve

Medium · Behavioral & Scenario-Based

Tell me about a time you disagreed with a technical decision made by a lead or architect. How did you resolve the conflict?

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 need to deliver features quickly with the responsibility of maintaining high code quali

Medium · Behavioral & Scenario-Based

How do you balance the need to deliver features quickly with the responsibility of maintaining high code quality and test coverage?

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?