CrossCountry Mortgage Software Engineer Interview Guide

The 60-second brief

At CrossCountry Mortgage, a Software Engineer plays a crucial role in bridging the gap between complex financial transactions and seamless digital experiences. As one of the nation’s fastest-growing retail mortgage lenders, the company relies heavily on its proprietary technology and integrated platforms to process, underwrite, and close loans efficiently. Your work in this role directly impacts loan officers, underwriters, and ultimately, homebuyers who depend on fast, reliable, and secure software to make one of the most significant purchases of their lives. You will join a fast-paced environment where software engineering is treated as a core business driver rather than a support function. The engineering team is tasked with building and maintaining highly scalable APIs, custom loan origination tools, and intuitive customer portals.

This guide is scoped to a Software Engineer candidate at CrossCountry Mortgage.

Focus areas

• Software Engineering
• Coding Interviews
• Problem Solving

The CrossCountry Mortgage interview process

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

Recruiter Screen

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

What to demonstrate

• Initial discussion to align on your background, career goals, and compensation expectations
• Depth in Software 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.

Online Assessment

Comprehensive assessment testing coding mechanics and cognitive problem-solving abilities.

What to demonstrate

• Comprehensive assessment testing coding mechanics and cognitive problem-solving abilities
• Depth in Software Engineering

How to prepare

• Answer aloud and timed: Solve a series of pattern recognition and logical deduction puzzles under strict time constraints.
• Answer aloud and timed: Implement a basic rate-limiting algorithm for an API endpoint.

Technical Interviews

Series of interviews focusing on system design capabilities, coding proficiency, and behavioral alignment.

What to demonstrate

• Series of interviews focusing on system design capabilities, coding proficiency, and behavioral alignment
• Depth in Software Engineering

How to prepare

• Answer aloud and timed: Explain the difference between optimistic and pessimistic locking in a high-concurrency database environment.
• Answer aloud and timed: How would you design a scalable system to ingest and process thousands of mortgage document uploads simultaneously?

Where candidates lose points

Master the fundamentals

Brush up on core data structures (arrays, strings, hash tables) and basic algorithms before taking the 110-minute assessment. Speed and accuracy are both heavily weighted.

Be proactive in communication

If an interviewer seems unstructured or unprepared, take the initiative to politely guide the conversation. Clearly explain your technical decisions and ask clarifying questions.

Highlight fintech-relevant experience

If you have worked with secure APIs, financial transactions, or highly regulated data, make sure to highlight this experience during your system design and behavioral rounds.

Questions & practice

Write a function to detect if a linked list contains a cycle, and optimize it for space complexity.

Medium · Coding & Cognitive Assessment

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 an array of integers representing loan processing times, find the contiguous subarray with the largest s

Medium · Coding & Cognitive Assessment

Given an array of integers representing loan processing times, find the contiguous subarray with the largest sum.

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 series of pattern recognition and logical deduction puzzles under strict time constraints.

Medium · Coding & Cognitive Assessment

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 optimistic and pessimistic locking in a high-concurrency database environment.

Medium · Coding & Cognitive Assessment

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?

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

• Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
• Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

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?

Implement a basic rate-limiting algorithm for an API endpoint.

Medium · Coding & Cognitive Assessment

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?

How would you design a scalable system to ingest and process thousands of mortgage document uploads simultaneo

Medium · System Design & Architecture

How would you design a scalable system to ingest and process thousands of mortgage document uploads simultaneously?

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 secure, audit-compliant logging mechanism for sensitive financial transacti

Medium · System Design & Architecture

Describe how you would implement a secure, audit-compliant logging mechanism for sensitive financial transactions.

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 API integration layer that connects our proprietary loan origination system with multiple third-part

Medium · System Design & Architecture

Design an API integration layer that connects our proprietary loan origination system with multiple third-party credit bureaus.

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?

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 CrossCountry Mortgage candidates report.

Day 1 — Map the CrossCountry Mortgage loop

• Write out the reported sequence: Recruiter Screen, Online Assessment, Technical 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 Software Engineering

• Spend the session on Software Engineering, which CrossCountry Mortgage candidates report being tested on.
• Write one worked example in Software Engineering and time yourself on it.

Deliverable: One timed worked example in Software Engineering.

Day 3 — Work Coding Interviews

• Spend the session on Coding Interviews, which CrossCountry Mortgage candidates report being tested on.
• Write one worked example in Coding Interviews and time yourself on it.

Deliverable: One timed worked example in Coding Interviews.

Day 4 — Work Problem Solving

• Spend the session on Problem Solving, which CrossCountry Mortgage 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 & Cognitive Assessment

• Answer aloud, timed: Write a function to detect if a linked list contains a cycle, and optimize it for space complexity.
• Answer aloud, timed: Given an array of integers representing loan processing times, find the contiguous subarray with the largest sum.

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

Day 6 — Answer out loud: System Design & Architecture

• Answer aloud, timed: How would you design a scalable system to ingest and process thousands of mortgage document uploads simultaneously?
• Answer aloud, timed: Describe how you would implement a secure, audit-compliant logging mechanism for sensitive financial transactions.

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

Day 7 — Answer out loud: Behavioral & Professional Collaboration

• Answer aloud, timed: Describe a time when you had to deliver a project under a tight deadline with incomplete requirements. How did you prioritize tasks?
• Answer aloud, timed: How do you handle a situation where a product manager requests a feature that compromises technical debt?

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

Behavioural preparation

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

How do you handle schema migrations in a production database with zero downtime?

Medium · System Design & Architecture

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 time when you had to deliver a project under a tight deadline with incomplete requirements. How did

Medium · Behavioral & Professional Collaboration

Describe a time when you had to deliver a project under a tight deadline with incomplete requirements. How did you prioritize tasks?

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 a situation where a product manager requests a feature that compromises technical debt?

Medium · Behavioral & Professional Collaboration

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 identified a critical bug in production. What immediate steps did you take to mitigat

Medium · Behavioral & Professional Collaboration

Tell me about a time you identified a critical bug in production. What immediate steps did you take to mitigate and resolve it?

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 keep your technical skills sharp and apply new engineering methodologies to your daily work?

Medium · Behavioral & Professional Collaboration

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?