Arcadis Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Arcadis, you play a vital role at the intersection of advanced software craftsmanship, data intelligence, and global engineering consultancy. Arcadis is a worldwide leader in delivering sustainable design, environment, and infrastructure solutions. Within this ecosystem, software engineering teams develop cutting-edge digital platforms, automated modeling tools, data pipelines, and client-facing web applications that power large-scale infrastructure, water management, environmental remediation, and urban planning projects across the globe. In this role, your technical contributions directly influence how complex physical assets and natural systems are monitored, analyzed, and optimized.

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

Focus areas

• Behavioral interview skills
• STAR method
• Water / wastewater management domain

The Arcadis interview process

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

Online Application

Candidates submit their applications online to initiate the process.

What to demonstrate

• Candidates submit their applications online to initiate the process
• Depth in Behavioral interview skills

How to prepare

• Answer aloud and timed: Explain object-oriented programming principles such as encapsulation, inheritance, and polymorphism, and describe how you apply them in system architecture.
• Answer aloud and timed: Walk us through core operating system concepts, memory management, and basic networking principles relevant to distributed web applications.

Assessments

Candidates undergo a series of assessments, including technical evaluations.

What to demonstrate

• Candidates undergo a series of assessments
• Including technical evaluations

How to prepare

• Answer aloud and timed: How do you approach designing a maintainable system architecture when dealing with continuous data streams and analytical workloads?
• Answer aloud and timed: Compare different data structures and explain when you would choose a hash table versus a balanced binary search tree for project data storage.

Behavioral Interviews

Interviews focus on assessing soft skills and cultural fit within the team.

What to demonstrate

• Interviews focus on assessing soft skills and cultural fit within the team
• Depth in Behavioral interview skills

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 behavioral interviews above and write down what you would ask to confirm before it.

Where candidates lose points

Preparing for an interview at Arcadis involves understanding both technical expectations and corporate values

Applying these targeted strategies will help you navigate your interview loop effectively.

Master the STAR Method for Behavioral Questions

Practice framing your past engineering experiences using Situation, Task, Action, and Result. Ensure your "Action" section clearly details your specific individual technical contributions.

Prepare Detailed Project Walkthroughs

Be ready to present a major project or dissertation in detail. Practice explaining why you chose a specific technology stack, how you handled database design, and how you resolved unexpected bugs.

Understand the Business & Sustainability Focus

Learn about Arcadis's core mission in sustainable infrastructure, water, and environmental solutions. Demonstrating enthusiasm for applying software engineering to real-world infrastructure challenges makes a strong impression.

Practice Clear Communication for Mixed Audiences

Remember that your interviewers may include technical architects alongside domain engineering managers. Keep your explanations clear, concise, and focused on practical outcomes.

Questions & practice

Compare different data structures and explain when you would choose a hash table versus a balanced binary sear

Medium · Technical & Domain Fundamentals

Compare different data structures and explain when you would choose a hash table versus a balanced binary search tree for project data storage.

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 manipulate array and string structures without using built-in helper functions or external

Medium · Coding & Algorithmic Problem Solving

Write a program to manipulate array and string structures without using built-in helper functions or external libraries.

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?

Solve a medium-level data structure challenge involving tree traversal or graph searching and discuss its time

Medium · Coding & Algorithmic Problem Solving

Solve a medium-level data structure challenge involving tree traversal or graph searching and discuss its time and space complexity.

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 implement an algorithm to validate system inputs or structural calculations while ensuring grace

Medium · Coding & Algorithmic Problem Solving

How would you implement an algorithm to validate system inputs or structural calculations while ensuring graceful error handling?

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?

Demonstrate how you would process, clean, and aggregate structured time-series data using your primary program

Medium · Coding & Algorithmic Problem Solving

Demonstrate how you would process, clean, and aggregate structured time-series data using your primary programming language.

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 you optimize recursive algorithms using dynamic programming or memoization technique.

Medium · Coding & Algorithmic Problem Solving

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 do you prioritize tasks and maintain code quality when working under tight timelines on concurrent client

Medium · Behavioral & Situational Judgment

How do you prioritize tasks and maintain code quality when working under tight timelines on concurrent client deliverables?

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 how you handle database indexing and query optimization when handling large spatial or operational da

Medium · Technical & Domain Fundamentals

Describe how you handle database indexing and query optimization when handling large spatial or operational datasets.

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?

Explain object-oriented programming principles such as encapsulation, inheritance, and polymorphism, and descr

Medium · Technical & Domain Fundamentals

Explain object-oriented programming principles such as encapsulation, inheritance, and polymorphism, and describe how you apply them in system architecture.

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?

Walk us through core operating system concepts, memory management, and basic networking principles relevant to

Medium · Technical & Domain Fundamentals

Walk us through core operating system concepts, memory management, and basic networking principles relevant to distributed web applications.

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 designing a maintainable system architecture when dealing with continuous data streams and

Medium · Technical & Domain Fundamentals

How do you approach designing a maintainable system architecture when dealing with continuous data streams and analytical workloads?

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?

Walk us through a major software project or dissertation on your resume, detailing your specific architectural

Medium · Project Architecture & Academic Experien

Walk us through a major software project or dissertation on your resume, detailing your specific architectural choices and contributions.

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 a significant technical challenge you faced during system implementation and explain the step-by-step

Medium · Project Architecture & Academic Experien

Describe a significant technical challenge you faced during system implementation and explain the step-by-step methodology you used to overcome it.

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 did you evaluate trade-offs between two different technical options or frameworks when designing a recent

Medium · Project Architecture & Academic Experien

How did you evaluate trade-offs between two different technical options or frameworks when designing a recent application?

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?

Give an example of how you converted domain requirements from non-technical stakeholders into modular software

Medium · Project Architecture & Academic Experien

Give an example of how you converted domain requirements from non-technical stakeholders into modular software modules.

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 testing strategies and CI/CD practices have you implemented to maintain code quality across past project

Medium · Project Architecture & Academic Experien

What testing strategies and CI/CD practices have you implemented to maintain code quality across past project cycles?

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?

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 Arcadis candidates report.

Day 1 — Map the Arcadis loop

• Write out the reported sequence: Online Application, Assessments, Behavioral Interviews.
• 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 Behavioral interview skills

• Spend the session on Behavioral interview skills, which Arcadis candidates report being tested on.
• Write one worked example in Behavioral interview skills and time yourself on it.

Deliverable: One timed worked example in Behavioral interview skills.

Day 3 — Work STAR method

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

Deliverable: One timed worked example in STAR method.

Day 4 — Work Water / wastewater management domain

• Spend the session on Water / wastewater management domain, which Arcadis candidates report being tested on.
• Write one worked example in Water / wastewater management domain and time yourself on it.

Deliverable: One timed worked example in Water / wastewater management domain.

Day 5 — Answer out loud: Technical & Domain Fundamentals

• Answer aloud, timed: Explain object-oriented programming principles such as encapsulation, inheritance, and polymorphism, and describe how you apply them in system architecture.
• Answer aloud, timed: Walk us through core operating system concepts, memory management, and basic networking principles relevant to distributed web applications.

Deliverable: Spoken answers to 2 reported Technical & Domain Fundamentals question(s), under time.

Day 6 — Answer out loud: Coding & Algorithmic Problem Solving

• Answer aloud, timed: Write a program to manipulate array and string structures without using built-in helper functions or external libraries.
• Answer aloud, timed: Solve a medium-level data structure challenge involving tree traversal or graph searching and discuss its time and space complexity.

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

Day 7 — Answer out loud: Project Architecture & Academic Experience

• Answer aloud, timed: Walk us through a major software project or dissertation on your resume, detailing your specific architectural choices and contributions.
• Answer aloud, timed: Describe a significant technical challenge you faced during system implementation and explain the step-by-step methodology you used to overcome it.

Deliverable: Spoken answers to 2 reported Project Architecture & Academic Experience question(s), under time.

Behavioural preparation

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

Tell me about a time when you had to work with a multidisciplinary team or manage conflicting stakeholder prio

Medium · Behavioral & Situational Judgment

Tell me about a time when you had to work with a multidisciplinary team or manage conflicting stakeholder priorities.

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?

Describe a scenario where a project deadline was at risk or requirements changed unexpectedly, and explain how

Medium · Behavioral & Situational Judgment

Describe a scenario where a project deadline was at risk or requirements changed unexpectedly, and explain how you adapted.

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?

Give an example of a situation where a technical project failed or did not go as planned, and share what key l

Medium · Behavioral & Situational Judgment

Give an example of a situation where a technical project failed or did not go as planned, and share what key lessons you learned.

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 applying your software engineering skills to infrastructure, environmental, and digi

Medium · Behavioral & Situational Judgment

Why are you interested in applying your software engineering skills to infrastructure, environmental, and digital engineering challenges at Arcadis?

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?