Guideline Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Guideline plays a critical role in reshaping how small businesses and their employees save for retirement. By building and scaling an all-in-one retirement platform, engineers directly manage the complex orchestration of financial transactions, automated portfolio rebalancing, compliance tracking, and user-facing administrative tools. The work is highly impactful, as the systems you build directly safeguard and grow billions of dollars in retirement assets for hundreds of thousands of everyday savers. The engineering team at Guideline tackles unique technical challenges that sit at the intersection of modern web development and robust financial infrastructure. You will work on a highly transactional platform where data integrity, security, and precision are paramount.

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

Focus areas

• Object-Oriented Programming (OOP)
• System Design
• Coding Assessments with Test Cases

The Guideline interview process

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

Recruiter Screen

Initial discussion to align on background, career goals, and compensation expectations.

What to demonstrate

• Initial discussion to align on background, career goals, and compensation expectations
• Depth in Object-Oriented Programming (OOP)

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 Rounds

Series of live coding and design evaluations focused on realistic business problems.

What to demonstrate

• Series of live coding and design evaluations focused on realistic business problems
• Depth in Object-Oriented Programming (OOP)

How to prepare

• Answer aloud and timed: Solve a classic array-manipulation problem under timed constraints, ensuring all provided test cases pass successfully.
• Answer aloud and timed: Given a set of athletic race times, write an algorithm to select the optimal group of four athletes to represent a team in a competitive event.

System Architecture Focus

Evaluation of system architecture and database design skills.

What to demonstrate

• Evaluation of system architecture and database design skills
• Depth in Object-Oriented Programming (OOP)

How to prepare

• Answer aloud and timed: Design a relational database schema and write optimized queries for a multi-parameter car selector system (filtering by year, model, and brand).
• Answer aloud and timed: Explain how you would model a transactional ledger system to ensure data consistency and prevent race conditions during concurrent financial transfers.

Collaboration Assessment

Assessment of ability to collaborate effectively with product managers and engineering leaders.

What to demonstrate

• Assessment of ability to collaborate effectively with product managers and engineering leaders
• Depth in Object-Oriented Programming (OOP)

How to prepare

• Answer aloud and timed: Design an asynchronous, event-driven workflow to process multi-step business logic, focusing on fault tolerance and message idempotency.
• Answer aloud and timed: Discuss how you would structure database indexes and partition large tables to maintain high query performance as the volume of financial records grows.

Where candidates lose points

Clarify the expected format early

Before your technical rounds, confirm with your recruiter whether the coding challenge expects an object-oriented design or a functional approach. Aligning on expectations early prevents syntax and compilation struggles during live coding.

Do not ignore compiler errors

If you experience syntax or compiler errors during the live coding round, pause to address them immediately. Interviewers highly value precision and want to see that you can debug your code systematically under pressure.

Speak your thoughts aloud

Throughout the system design and database modeling rounds, continuously explain your reasoning. Making your architectural trade-offs explicit helps the interviewer guide you and understand your engineering philosophy.

Questions & practice

Write a program to rebalance a stock portfolio to match a target wallet allocation (e.g., target allocations o

Medium · Technical & Domain-Specific Coding

Write a program to rebalance a stock portfolio to match a target wallet allocation (e.g., target allocations of 25% for Asset X, 25% for Asset Y, and 50% for Asset Z).

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 function contains_all to verify asset collections, and discuss how you would optimize this logic

Medium · Technical & Domain-Specific Coding

Implement a function contains_all to verify asset collections, and discuss how you would optimize this logic if the data were stored in a relational database.

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 classic array-manipulation problem under timed constraints, ensuring all provided test cases pass succ

Medium · Technical & Domain-Specific Coding

Solve a classic array-manipulation problem under timed constraints, ensuring all provided test cases pass successfully.

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 set of athletic race times, write an algorithm to select the optimal group of four athletes to represe

Medium · Technical & Domain-Specific Coding

Given a set of athletic race times, write an algorithm to select the optimal group of four athletes to represent a team in a competitive event.

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 would model a transactional ledger system to ensure data consistency and prevent race conditio

Medium · Database & System Design

Explain how you would model a transactional ledger system to ensure data consistency and prevent race conditions during concurrent financial transfers.

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?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.

Approach

1. Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
2. Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
3. For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
4. State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.

Follow-up

• A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
• How do you honour an erasure request while resource_revision.actor_user_id still references this table?

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?

Design a relational database schema and write optimized queries for a multi-parameter car selector system (fil

Medium · Database & System Design

Design a relational database schema and write optimized queries for a multi-parameter car selector system (filtering by year, model, and brand).

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?

Design an asynchronous, event-driven workflow to process multi-step business logic, focusing on fault toleranc

Medium · Database & System Design

Design an asynchronous, event-driven workflow to process multi-step business logic, focusing on fault tolerance and message idempotency.

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?

Discuss how you would structure database indexes and partition large tables to maintain high query performance

Medium · Database & System Design

Discuss how you would structure database indexes and partition large tables to maintain high query performance as the volume of financial records grows.

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 me through a challenging technical problem you solved in a past role, detailing the architectural trade-o

Medium · Behavioral & Past Experience

Walk me through a challenging technical problem you solved in a past role, detailing the architectural trade-offs you made.

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 log partition stops advancing while the others drain

Easy · poison message · head-of-line blocking · consumer lag

Search results for a subset of tenants are hours stale; the rest are current. The projection consumer reports lag of zero on 15 of 16 partitions and 400,000 on one. Its error rate is flat and its CPU is idle. outbox_event has no pending rows older than a second, so the relay has published everything it holds. Identify the mechanism, give the ordered checks, and state what you do in the first ten minutes versus what you change permanently.

Approach

1. Read the lag distribution first. A slow consumer lags everywhere; zero on fifteen partitions and 400,000 on one is not throughput. Idle CPU on the stuck partition means the consumer is not advancing its offset at all, which points at one message it cannot get past rather than at a rate problem.
2. Exonerate the producer before touching the consumer. No pending outbox rows older than a second means the relay published, so the event exists in the log. This separates never sent from sent and never applied, which are different code paths and usually different owners.
3. Read the message at the stuck offset and the handler's log lines for its event_id. A flat error rate with no progress has two explanations and you must distinguish them: the handler is throwing and the retry loop is swallowing it, or the handler is blocking on something and never returning. Idle CPU with no error lines favours the second.
4. Mitigate before diagnosing further. Move the offending event to a dead-letter store and commit the offset past it. Adding consumers does nothing here, because a partition is consumed by exactly one member of the group, and the blast radius is every aggregate hashed to that partition, not only the aggregate that produced the bad event.

Follow-up

• The dead-lettered event carried aggregate_version 7 and the projection had applied 6. What must the replay do differently if 8 and 9 landed in the meantime?
• How do you show staleness to the user while the partition is behind, given the API already returns the projection's watermark?

Suggested practice checklist

Built from the rounds and topics Guideline candidates report.

Day 1 — Map the Guideline loop

• Write out the reported sequence: Recruiter Screen, Technical Rounds, System Architecture Focus, Collaboration Assessment.
• 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 Object-Oriented Programming (OOP)

• Spend the session on Object-Oriented Programming (OOP), which Guideline candidates report being tested on.
• Write one worked example in Object-Oriented Programming (OOP) and time yourself on it.

Deliverable: One timed worked example in Object-Oriented Programming (OOP).

Day 3 — Work System Design

• Spend the session on System Design, which Guideline 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 4 — Work Coding Assessments with Test Cases

• Spend the session on Coding Assessments with Test Cases, which Guideline candidates report being tested on.
• Write one worked example in Coding Assessments with Test Cases and time yourself on it.

Deliverable: One timed worked example in Coding Assessments with Test Cases.

Day 5 — Answer out loud: Technical & Domain-Specific Coding

• Answer aloud, timed: Write a program to rebalance a stock portfolio to match a target wallet allocation (e.g., target allocations of 25% for Asset X, 25% for Asset Y, and 50% for Asset Z).
• Answer aloud, timed: Implement a function contains_all to verify asset collections, and discuss how you would optimize this logic if the data were stored in a relational database.

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

Day 6 — Answer out loud: Database & System Design

• Answer aloud, timed: Design a relational database schema and write optimized queries for a multi-parameter car selector system (filtering by year, model, and brand).
• Answer aloud, timed: Explain how you would model a transactional ledger system to ensure data consistency and prevent race conditions during concurrent financial transfers.

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

Day 7 — Answer out loud: Behavioral & Past Experience

• Answer aloud, timed: Walk me through a challenging technical problem you solved in a past role, detailing the architectural trade-offs you made.
• Answer aloud, timed: Describe a time when you had to work with a legacy system or technical debt, and how you managed to deliver new features despite those constraints.

Deliverable: Spoken answers to 2 reported Behavioral & Past Experience question(s), under time.

Behavioural preparation

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

Describe a time when you had to work with a legacy system or technical debt, and how you managed to deliver ne

Medium · Behavioral & Past Experience

Describe a time when you had to work with a legacy system or technical debt, and how you managed to deliver new features despite those constraints.

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 situations where there is a misalignment between product requirements and engineering constr

Medium · Behavioral & Past Experience

How do you handle situations where there is a misalignment between product requirements and engineering constraints?

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?

Share an experience where you had to quickly learn a new technology or domain to deliver a critical project on

Medium · Behavioral & Past Experience

Share an experience where you had to quickly learn a new technology or domain to deliver a critical project on time.

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?