Interview guides · John Holland
John Holland Software Engineer Interview Guide
John Holland Software Engineer interview guide: reported rounds, questions and how candidates describe the process.
The 60-second brief
A Software Engineer at John Holland operates at the intersection of complex infrastructure, systems integration, and cutting-edge engineering. Unlike traditional pure-software roles, this position demands a deep understanding of how code and digital systems interface with large-scale physical projects, such as signalling, telecommunications, and electrical systems in the rail and construction sectors. Your impact is direct and tangible. You are responsible for ensuring that the technical frameworks powering critical infrastructure are robust, scalable, and compliant with the highest safety standards. Whether you are working on project signalling, electrical services, or telecommunications, your work ensures that John Holland projects remain at the forefront of the industry, delivering efficiency and reliability to clients across Australia.
This guide is scoped to a Software Engineer candidate at John Holland.
Focus areas
- Electrical Engineering
- Signalling Systems
- Telecommunications Engineering
The John Holland interview process
John Holland candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.
Recruiter Screen
Initial screening by a recruiter to assess fit for the role.
What to demonstrate
- Initial screening by a recruiter to assess fit for the role
- Depth in Electrical Engineering
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 Interviews
One or more technical interviews with team members and project managers focusing on technical background.
What to demonstrate
- One or more technical interviews with team members and project managers focusing on technical background
- Depth in Electrical Engineering
How to prepare
- Answer aloud and timed: Describe your experience with PLC programming or industrial automation software.
- Answer aloud and timed: How do you handle system failures in a real-time, mission-critical environment?
Project Delivery Discussion
Discussion on handling practical challenges related to project delivery.
What to demonstrate
- Discussion on handling practical challenges related to project delivery
- Depth in Electrical Engineering
How to prepare
- Answer aloud and timed: What is your strategy for maintaining documentation and version control in long-term engineering projects?
- Answer aloud and timed: Describe a time you faced a significant technical bottleneck during a project; how did you resolve it?
Where candidates lose points
Understand the Project Portfolio
Research the specific infrastructure projects John Holland is currently undertaking, such as rail signalling or large-scale electrical grid upgrades.
Prioritize Safety
Always frame your technical decisions within the context of safety and risk mitigation.
Be Precise
In engineering, details matter. Ensure your answers reflect a high level of attention to detail and a commitment to accuracy.
Prepare for Ambiguity
Real-world projects often have incomplete requirements. Show how you gather the information you need to move forward confidently.
Questions & practice
How do you prioritize tasks when managing multiple streams of engineering work?
Medium · Project Management and Problem Solving
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?
Give an example of how you have translated complex stakeholder requirements into technical specifications.
Medium · Project Management and Problem Solving
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 do you ensure your work aligns with the overall project timeline and budget?
Medium · Project Management and Problem Solving
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?
Stop tag and share joins from fanning out a page
Medium · join fan-out · semi-joins · many-to-many
resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.
Approach
- Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
- Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
- Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
- Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.
Follow-up
- The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
- A resource can be shared with the same user twice under different permissions. Does your count change, and should it?
Replace offset paging on the resource feed with keyset
Easy · keyset pagination · composite index · sort order
resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.
Approach
- Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
- Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
- Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
- Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.
Follow-up
- The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
- Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?
Explain your process for ensuring code compliance with safety-critical infrastructure standards.
Medium · Technical and Domain Expertise
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 approach the integration of legacy hardware systems with modern software interfaces?
Medium · Technical and Domain Expertise
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- 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?
What is your strategy for maintaining documentation and version control in long-term engineering projects?
Medium · Technical and Domain Expertise
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?
Listing latency scales with page size, not with filters
Easy · n+1 · latency · query batching
The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.
Approach
- Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
- Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
- Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
- Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.
Follow-up
- The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
- How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?
Suggested practice checklist
Built from the rounds and topics John Holland candidates report.
Day 1 — Map the John Holland loop
- Write out the reported sequence: Recruiter Screen, Technical Interviews, Project Delivery Discussion.
- 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 Electrical Engineering
- Spend the session on Electrical Engineering, which John Holland candidates report being tested on.
- Write one worked example in Electrical Engineering and time yourself on it.
Deliverable: One timed worked example in Electrical Engineering.
Day 3 — Work Signalling Systems
- Spend the session on Signalling Systems, which John Holland candidates report being tested on.
- Write one worked example in Signalling Systems and time yourself on it.
Deliverable: One timed worked example in Signalling Systems.
Day 4 — Work Telecommunications Engineering
- Spend the session on Telecommunications Engineering, which John Holland candidates report being tested on.
- Write one worked example in Telecommunications Engineering and time yourself on it.
Deliverable: One timed worked example in Telecommunications Engineering.
Day 5 — Answer out loud: Technical and Domain Expertise
- Answer aloud, timed: Explain your process for ensuring code compliance with safety-critical infrastructure standards.
- Answer aloud, timed: How do you approach the integration of legacy hardware systems with modern software interfaces?
Deliverable: Spoken answers to 2 reported Technical and Domain Expertise question(s), under time.
Day 6 — Answer out loud: Project Management and Problem Solving
- Answer aloud, timed: Describe a time you faced a significant technical bottleneck during a project; how did you resolve it?
- Answer aloud, timed: How do you prioritize tasks when managing multiple streams of engineering work?
Deliverable: Spoken answers to 2 reported Project Management and Problem Solving question(s), under time.
Day 7 — Dry run for John Holland
- Run one full mock under time, then write down the two questions you most want to ask your interviewers.
Deliverable: A completed timed mock and two questions to ask.
Behavioural preparation
Behavioural rounds judge the decision you made and what it cost.
Describe your experience with PLC programming or industrial automation software.
Medium · Technical and Domain Expertise
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 system failures in a real-time, mission-critical environment?
Medium · Technical and Domain Expertise
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?
Describe a time you faced a significant technical bottleneck during a project; how did you resolve it?
Medium · Project Management and Problem Solving
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?