Marsh & Mclennan is a premier global professional services firm specializing in risk, strategy, and people. As a Software Engineer at Marsh & Mclennan, you will play a critical role in designing, building, and maintaining high-performance software systems that power global risk management, insurance brokerage, and consulting platforms. The solutions you develop directly impact how multinational corporations analyze risk, allocate capital, and protect their workforces. In this role, you will work on enterprise-scale applications that require high availability, robust security, and seamless data processing capabilities. Engineering teams at Marsh & Mclennan are tasked with modernizing legacy systems, migrating core services to the cloud, and developing sophisticated APIs that integrate with diverse backend systems. This position offers a unique blend of complex technical challenges and strategic business influence, making it an exciting environment for engineers who want their code to have a tangible global impact. Whether you are optimizing database queries to handle massive financial datasets or architecting microservices to support real-time risk analytics, your work will directly drive the firm's digital transformation. You will collaborate closely with cross-functional teams of product managers, data analysts, and system architects to deliver reliable, user-focused software that maintains 's position as an industry leader. Marsh & Mclennan
Automated Screening
reportedInitial phase involving an online aptitude test, basic coding assessment, or AI-powered video interview to evaluate resume and foundational technical knowledge.
What to demonstrate
- Initial phase involving an online aptitude test, basic coding assessment, or AI-powered video interview to evaluate resume and foundational technical knowledge
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Explain the lifecycle of an ASP.NET MVC request and how routing is handled.
- Answer aloud and timed: How do you implement dependency injection in a.NET Core application, and what are its primary benefits?
Technical Rounds
reportedLive coding sessions focusing on easy-to-medium level questions, SQL query design, and discussions about past projects and architectural choices.
What to demonstrate
- Live coding sessions focusing on easy-to-medium level questions, SQL query design, and discussions about past projects and architectural choices
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Write a SQL query using complex joins and window functions to retrieve specific transactional data.
- Answer aloud and timed: What is the difference between abstract classes and interfaces in C#, and when would you use each?
System Design Round
reportedFor mid-to-senior positions, candidates map out API communications and backend integrations.
What to demonstrate
- For mid-to-senior positions, candidates map out API communications and backend integrations
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Explain how you would optimize a slow-performing database query or index in SQL Server.
- Answer aloud and timed: Given an array of integers, write a function to find the two numbers that add up to a specific target.
Managerial and Behavioral Interviews
reportedPanel interviews assessing alignment with corporate values, experience in Agile environments, and soft skills.
What to demonstrate
- Panel interviews assessing alignment with corporate values, experience in Agile environments, and soft skills
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
- Re-read the description of the managerial and behavioral interviews above and write down what you would ask to confirm before it.
Final HR Discussions
reportedFinal discussions with HR regarding salary negotiations and other employment terms.
What to demonstrate
- Final discussions with HR regarding salary negotiations and other employment terms
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Write a clean, optimal algorithm to detect if a string is a palindrome while ignoring spaces and punctuation.
- Answer aloud and timed: Design a RESTful API and explain how it would securely communicate with various backend services.
PracHub editorial advice for the preparation topics above.
Practice Structured Communication
When answering behavioral or technical design questions, use the STAR method (Situation, Task, Action, Result). This keeps your answers concise and ensures you highlight your specific contributions.
Brush Up on SQL Fundamentals
Do not neglect database questions. Candidates are frequently asked to write live SQL queries, explain indexing, or discuss database normalization during the technical rounds.
Understand Agile Ceremonies
Be ready to discuss how you actively contribute to sprint planning, standups, and retrospectives. Showing that you understand how to optimize these events to improve team velocity is highly valued.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Given an array of integers, write a function to find the two numbers that add up to a specific target.
Given an array of integers, write a function to find the two numbers that add up to a specific target.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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 implement a function to reverse a linked list, and what is its time complexity?
How would you implement a function to reverse a linked list, and what is its time complexity?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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?
Solve a logical puzzle involving probability or resource allocation to demonstrate your structured thinking.
Solve a logical puzzle involving probability or resource allocation to demonstrate your structured thinking.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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 clean, optimal algorithm to detect if a string is a palindrome while ignoring spaces and punctuation.
Write a clean, optimal algorithm to detect if a string is a palindrome while ignoring spaces and punctuation.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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 SQL query using complex joins and window functions to retrieve specific transactional data.
Write a SQL query using complex joins and window functions to retrieve specific transactional data.
Approach
- Name the grain you start from and join outward from it.
- Check whether any join is one-to-many before aggregating, or the sums inflate.
- Say which index the query would use, and what makes it unusable.
- 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 how you would optimize a slow-performing database query or index in SQL Server.
Explain how you would optimize a slow-performing database query or index in SQL Server.
Approach
- Name the grain you start from and join outward from it.
- Check whether any join is one-to-many before aggregating, or the sums inflate.
- Say which index the query would use, and what makes it unusable.
- 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 the lifecycle of an ASP.NET MVC request and how routing is handled.
Explain the lifecycle of an ASP.NET MVC request and how routing is handled.
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
How do you implement dependency injection in a.NET Core application, and what are its primary benefits?
How do you implement dependency injection in a.NET Core application, and what are its primary benefits?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- 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 is the difference between abstract classes and interfaces in C#, and when would you use each?
What is the difference between abstract classes and interfaces in C#, and when would you use each?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
Design a RESTful API and explain how it would securely communicate with various backend services.
Design a RESTful API and explain how it would securely communicate with various backend services.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 system to handle high-volume batch processing of financial transactions?
How would you design a system to handle high-volume batch processing of financial transactions?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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?
Walk through the process of migrating a monolithic application to a microservices architecture.
Walk through the process of migrating a monolithic application to a microservices architecture.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 ensure high availability and disaster recovery when deploying applications to the cloud?
How do you ensure high availability and disaster recovery when deploying applications to the cloud?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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?
p99 jumped on one listing filter while p50 stayed flat
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
- 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.
- 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.
- 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.
- 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?
Built from the rounds and topics Marsh & Mclennan candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Marsh & Mclennan loop
- Write out the reported sequence: Automated Screening, Technical Rounds, System Design Round, Managerial and Behavioral Interviews, Final HR Discussions.
- 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 5 reported rounds, with the weakest marked.
02Work Data Structures & Algorithms (DSA)
- Spend the session on Data Structures & Algorithms (DSA), which Marsh & Mclennan candidates report being tested on.
- Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.
Deliverable: One timed worked example in Data Structures & Algorithms (DSA).
03Work System Design (API Design)
- Spend the session on System Design (API Design), which Marsh & Mclennan candidates report being tested on.
- Write one worked example in System Design (API Design) and time yourself on it.
Deliverable: One timed worked example in System Design (API Design).
04Work Docker
- Spend the session on Docker, which Marsh & Mclennan candidates report being tested on.
- Write one worked example in Docker and time yourself on it.
Deliverable: One timed worked example in Docker.
05Answer out loud: Technical & Domain Knowledge
- Answer aloud, timed: Explain the lifecycle of an ASP.NET MVC request and how routing is handled.
- Answer aloud, timed: How do you implement dependency injection in a.NET Core application, and what are its primary benefits?
Deliverable: Spoken answers to 2 reported Technical & Domain Knowledge question(s), under time.
06Answer out loud: Coding & Algorithmic Problem Solving
- Answer aloud, timed: Given an array of integers, write a function to find the two numbers that add up to a specific target.
- Answer aloud, timed: How would you implement a function to reverse a linked list, and what is its time complexity?
Deliverable: Spoken answers to 2 reported Coding & Algorithmic Problem Solving question(s), under time.
07Answer out loud: System Design & Architecture
- Answer aloud, timed: Design a RESTful API and explain how it would securely communicate with various backend services.
- Answer aloud, timed: How would you design a system to handle high-volume batch processing of financial transactions?
Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Describe a time when you had to manage a technical conflict between two developers on your team.
Describe a time when you had to manage a technical conflict between two developers on your team.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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 overcome challenges when managing or participating in Agile events like sprint planning or retrospe
How do you overcome challenges when managing or participating in Agile events like sprint planning or retrospectives?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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?
Walk me through a highly complex project you recently completed, focusing on the hardest technical challenge y
Walk me through a highly complex project you recently completed, focusing on the hardest technical challenge you overcame.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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 a project's requirements change mid-sprint?
How do you handle a situation where a project's requirements change mid-sprint?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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?
- 01
Describe a time when you had to manage a technical conflict between two developers on your team.
- 02
How do you overcome challenges when managing or participating in Agile events like sprint planning or retrospectives?
- 03
Walk me through a highly complex project you recently completed, focusing on the hardest technical challenge you overcame.
- 04
How do you handle a situation where a project's requirements change mid-sprint?
What is the technical difficulty of the Software Engineer interview process?
The technical difficulty is generally rated as average to difficult. While you do not need to master highly abstract competitive programming algorithms, you must have a very solid grasp of practical data structures, SQL query writing, API design, and core object-oriented programming principles.
Marsh & Mclennan Software Engineer candidate reports ↗How much time should I dedicate to preparing for the coding portion?
You should focus on mastering Leetcode easy-to-medium level questions, particularly around arrays, strings, and basic data structures. Dedicating two to three weeks to practicing these topics, along with SQL query optimization, is usually sufficient for most candidates.
Marsh & Mclennan Software Engineer candidate reports ↗What are they looking for in the behavioral rounds?
Interviewers are looking for clear communication, a collaborative mindset, and structured problem-solving. Be prepared to discuss how you manage technical challenges, resolve conflicts within Agile teams, and align your daily work with broader business objectives.
Marsh & Mclennan Software Engineer candidate reports ↗Is there flexibility in the programming languages used during the interview?
While the firm heavily utilizes the Microsoft technology stack, they are often open to candidates with strong foundations in other modern OOP languages (like Java) for general coding rounds. However, showing proficiency in C# and.NET will give you a significant advantage.
Marsh & Mclennan Software Engineer candidate reports ↗What topics does Marsh & Mclennan test in interviews?
Marsh & Mclennan interviews most often cover Behavioral Interviewing, Behavioral interviewing, Communication skills, SQL, and Communication. The exact emphasis depends on the specific role you apply for.
Marsh & Mclennan Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Marsh & Mclennan Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Vercel Software Engineer Interview Guide
Debugging practice for Vercel software engineer prep built on a reproduction you trust, narrowing to the smallest failing input, and changing one variable per run so the result stays attributable.
Together Ai Software Engineer Interview Guide
Failure-handling practice for Together Ai software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Lambda Software Engineer Interview Guide
Failure-handling practice for Lambda software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
CoreWeave Software Engineer Interview Guide
Failure-handling practice for CoreWeave software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.