As a Software Engineer at Miter, you will build the foundational financial and operational infrastructure for the construction industry. Construction is one of the largest but least digitized sectors of the economy, and Miter is modernizing it by building specialized payroll, HR, and compliance software. Your work will directly impact how contractors manage complex labor rules, process millions of dollars in payroll, and keep their businesses running smoothly. This role requires solving highly complex domain modeling problems, such as managing prevailing wage laws, union rate sheets, and multi-state compliance. Because Miter operates in the fintech and workforce management space, your code must be exceptionally reliable, secure, and performant. You will work on a modern tech stack to build features that translate intricate government and union regulations into seamless, intuitive workflows for our customers. Engineering at Miter is highly collaborative and fast-paced. You will not just write code; you will participate in product discovery, collaborate closely with design and operations, and have a major voice in architectural decisions. If you enjoy taking ownership of complex, ambiguous problems and building products that have a tangible impact on real-world workers, this is the ideal environment for you.
Initial Recruiter Screen
reportedThe process begins with a conversation with a recruiter to discuss your background and the role.
What to demonstrate
- The process begins with a conversation with a recruiter to discuss your background and the role
- Depth in System Design
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 Assessments
reportedCandidates undergo technical assessments that simulate real-world engineering tasks.
What to demonstrate
- Candidates undergo technical assessments that simulate real-world engineering tasks
- Depth in System Design
How to prepare
- Answer aloud and timed: Design an algorithm to reconcile transactions between two different ledger systems and identify discrepancies.
- Answer aloud and timed: Given a list of construction shifts with overlapping times, write a function to merge overlapping shifts and calculate total billable hours.
Onsite Rounds
reportedCandidates participate in onsite interviews, which may include multiple rounds.
What to demonstrate
- Candidates participate in onsite interviews, which may include multiple rounds
- Depth in System Design
How to prepare
- Answer aloud and timed: Design a resilient payroll processing pipeline that can guarantee exactly-once execution for bank transfers.
- Answer aloud and timed: How would you architect a system to store and query highly dynamic compliance rate sheets that change based on location and job type?
PracHub editorial advice for the preparation topics above.
Over-communicate your thoughts
During coding and system design rounds, talk through your approach before writing code. This allows the interviewer to understand your reasoning and guide you if you stray off course.
Focus on simple, clean solutions first
Avoid over-engineering. Build a working, straightforward solution to the problem first, and then discuss potential optimizations and trade-offs with your interviewer.
Do not skip writing tests or discussing edge cases during your coding interview
Interviewers highly value candidates who proactively verify their code's correctness.
Show curiosity about the domain
The construction fintech space is highly complex and unique. Asking insightful questions about our product, our users, and the regulatory challenges we solve demonstrates genuine interest and engagement.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Write a function that parses complex, nested payroll data and calculates total earnings based on varying overt
Write a function that parses complex, nested payroll data and calculates total earnings based on varying overtime rules.
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?
Given a list of construction shifts with overlapping times, write a function to merge overlapping shifts and c
Given a list of construction shifts with overlapping times, write a function to merge overlapping shifts and calculate total billable hours.
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?
Describe a situation where you had to work with a highly ambiguous requirement. How did you clarify the scope?
Describe a situation where you had to work with a highly ambiguous requirement. How did you clarify the scope?
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?
Hold a per-tenant active cap against concurrent creates
A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.
Approach
- Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
- Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
- Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
- State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.
Follow-up
- A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
- The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?
Keep soft-deleted accounts from blocking re-registration
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
- 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.
- 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.
- 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.
- 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?
Implement a rate-limiting middleware for an API endpoint to prevent abuse while ensuring high availability.
Implement a rate-limiting middleware for an API endpoint to prevent abuse while ensuring high availability.
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?
Design an algorithm to reconcile transactions between two different ledger systems and identify discrepancies.
Design an algorithm to reconcile transactions between two different ledger systems and identify discrepancies.
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?
Design a resilient payroll processing pipeline that can guarantee exactly-once execution for bank transfers.
Design a resilient payroll processing pipeline that can guarantee exactly-once execution for bank transfers.
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 architect a system to store and query highly dynamic compliance rate sheets that change based on
How would you architect a system to store and query highly dynamic compliance rate sheets that change based on location and job type?
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?
Design a real-time notification system that alerts field workers and office administrators of compliance viola
Design a real-time notification system that alerts field workers and office administrators of compliance violations.
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 secure document upload and verification service that handles sensitive tax and employme
How would you design a secure document upload and verification service that handles sensitive tax and employment forms?
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?
Exports duplicate a row range about once a week
Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.
Approach
- Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
- Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
- Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
- Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.
Follow-up
- The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
- You now count takeovers. What alert fires on that counter, and at what threshold?
Built from the rounds and topics Miter candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Miter loop
- Write out the reported sequence: Initial Recruiter Screen, Technical Assessments, Onsite Rounds.
- 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.
02Work System Design
- Spend the session on System Design, which Miter 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.
03Work Communication Skills
- Spend the session on Communication Skills, which Miter candidates report being tested on.
- Write one worked example in Communication Skills and time yourself on it.
Deliverable: One timed worked example in Communication Skills.
04Work Technical Problem Solving
- Spend the session on Technical Problem Solving, which Miter candidates report being tested on.
- Write one worked example in Technical Problem Solving and time yourself on it.
Deliverable: One timed worked example in Technical Problem Solving.
05Answer out loud: Coding & Algorithmic Problem Solving
- Answer aloud, timed: Implement a rate-limiting middleware for an API endpoint to prevent abuse while ensuring high availability.
- Answer aloud, timed: Write a function that parses complex, nested payroll data and calculates total earnings based on varying overtime rules.
Deliverable: Spoken answers to 2 reported Coding & Algorithmic Problem Solving question(s), under time.
06Answer out loud: System Design & Architecture
- Answer aloud, timed: Design a resilient payroll processing pipeline that can guarantee exactly-once execution for bank transfers.
- Answer aloud, timed: How would you architect a system to store and query highly dynamic compliance rate sheets that change based on location and job type?
Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.
07Answer out loud: Behavioral & Collaboration
- Answer aloud, timed: Tell me about a time you had to make a technical trade-off to meet a tight product deadline.
- Answer aloud, timed: Describe a situation where you had to work with a highly ambiguous requirement. How did you clarify the scope?
Deliverable: Spoken answers to 2 reported Behavioral & Collaboration 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.
Tell me about a time you had to make a technical trade-off to meet a tight product deadline.
Tell me about a time you had to make a technical trade-off to meet a tight product deadline.
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?
Tell me about a time you disagreed with a product manager or another engineer on an architectural decision. Ho
Tell me about a time you disagreed with a product manager or another engineer on an architectural decision. How did you resolve it?
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?
Give an example of a difficult bug you encountered in production. How did you diagnose, fix, and prevent it fr
Give an example of a difficult bug you encountered in production. How did you diagnose, fix, and prevent it from happening again?
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
Tell me about a time you had to make a technical trade-off to meet a tight product deadline.
- 02
Tell me about a time you disagreed with a product manager or another engineer on an architectural decision. How did you resolve it?
- 03
Give an example of a difficult bug you encountered in production. How did you diagnose, fix, and prevent it from happening again?
What is the typical timeline for the Miter interview process?
The process is exceptionally fast and communicative. From the initial recruiter screen to the final offer decision, the process typically takes between two to three weeks, with updates provided at every stage.
Miter Software Engineer candidate reports ↗How much preparation time is recommended for the technical interviews?
We recommend spending one to two weeks brushing up on system design fundamentals, database modeling, and hands-on coding. Focus on practical, real-world engineering scenarios rather than abstract algorithmic puzzles.
Miter Software Engineer candidate reports ↗What is the hybrid/remote work policy at Miter?
While we have a physical presence in San Francisco, CA, we hire across the United States for many of our engineering roles. Specific hybrid or remote arrangements depend on the team and location listed in the job posting.
Miter Software Engineer candidate reports ↗What distinguishes successful candidates during the onsite loop?
Successful candidates are highly collaborative, communicate their thought processes clearly, and demonstrate strong product empathy. They don't just write code; they ask why a feature is being built and how it impacts the end-user.
Miter Software Engineer candidate reports ↗What topics does Miter test in interviews?
Miter interviews most often cover Technical Problem Solving, Scalability, Data Modeling, Experimentation (A/B Testing), and Stakeholder Communication. The exact emphasis depends on the specific role you apply for.
Miter 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.
- 01Miter 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.
Cognition Software Engineer Interview Guide
What Cognition asks Software Engineer candidates, from reported rounds and questions.
Discord Software Engineer Interview Guide
Database practice for Discord candidates: how an index changes a query plan, and which anomalies survive a given isolation level, since read committed still permits non-repeatable reads.
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.
Aerospike Software Engineer Interview Questions & Guide 2026
Aerospike database-engine preparation through an original single-owner Python key-value store with bounded logical index accounting, disk-offset reads, conditional writes, tombstones, process-restart recovery and 3,240 checks. Existing 14 p