cswork / libraryOpen practice workspace

Interview guides · Insurity

Insurity Software Engineer Interview Guide

Insurity Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

A Software Engineer at Insurity is responsible for building, modernizing, and maintaining the enterprise-grade SaaS platforms that power the global insurance industry. Insurity is a leading provider of cloud-based software for property and casualty (P&C) insurance carriers, brokers, and MGAs. In this role, you will work on highly complex, configurable systems that handle critical business functions such as policy administration, billing, claims management, and predictive analytics. The impact of your work is substantial. The applications you develop process billions of dollars in premiums and support the daily operations of hundreds of insurance institutions. Because the insurance domain is governed by intricate regulatory frameworks and massive transaction volumes, the technical challenges you will face involve high scalability, strict data integrity, and complex business logic.

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

Focus areas

  • Object-Oriented Design (OOD)
  • Programming Fundamentals
  • Data Structures

The Insurity interview process

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

Recruiter Call

Initial discussion with a recruiter about your background, career interests, and alignment with the role.

What to demonstrate

  • Initial discussion with a recruiter about your background, career interests, and alignment with the role
  • Depth in Object-Oriented Design (OOD)

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 Evaluations

Involves live technical discussions, online aptitude assessments, or a practical take-home project.

What to demonstrate

  • Involves live technical discussions, online aptitude assessments, or a practical take-home project
  • Depth in Object-Oriented Design (OOD)

How to prepare

  • Answer aloud and timed: How do you design a system to ensure it is highly configurable without requiring constant code redeployments?
  • Answer aloud and timed: Describe a design pattern you frequently use. What problem does it solve, and what are its trade-offs?

Final Rounds

Face-to-face or video conference interviews with engineering managers, senior developers, and system architects.

What to demonstrate

  • Face-to-face or video conference interviews with engineering managers, senior developers, and system architects
  • Depth in Object-Oriented Design (OOD)

How to prepare

  • Answer aloud and timed: How do you approach refactoring a tightly coupled codebase to improve its testability?
  • Answer aloud and timed: Walk me through your step-by-step process for debugging a complex, intermittent issue in a production environment.

Where candidates lose points

Punctuality is critical

Candidates have reported that even a two-minute delay in joining a call due to technical or external issues can result in immediate cancellation or rescheduling difficulties. Ensure your setup is tested and you are active a few minutes early.

Focus on the "Why

When explaining your past projects or coding solutions, don't just describe what you built. Focus heavily on why you made specific design, architectural, and technology choices, and discuss the trade-offs involved.

Highlight Domain Complexity

If you have worked on systems with complex business rules, high transaction volumes, or strict regulatory requirements, make sure to highlight these experiences. They translate directly to the challenges you will face at Insurity.

Questions & practice

How do you determine which data structure (e.g., a hash map versus a list) is most appropriate for a specific

Medium · Technical Problem-Solving & Debugging

How do you determine which data structure (e.g., a hash map versus a list) is most appropriate for a specific performance-critical task?

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?

Diff a projection against the primary without per-row point reads

Hard · reconciliation · range hashing · throttling

The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.

Approach

  1. Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
  2. Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
  3. For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
  4. Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.

Follow-up

  • The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
  • Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?

Merge partitioned event streams into one ordered feed with bounded lateness

Hard · k-way merge · watermarks · out-of-order streams

The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.

Approach

  1. Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
  2. Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
  3. Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
  4. Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.

Follow-up

  • The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
  • The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?

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

  1. 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.
  2. 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.
  3. 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.
  4. 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?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

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

  1. 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.
  2. 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.
  3. 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.
  4. 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?

Explain the core principles of Object-Oriented Design (OOD). How have you applied these principles in your pas

Medium · Object-Oriented Design & Architecture

Explain the core principles of Object-Oriented Design (OOD). How have you applied these principles in your past projects?

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 is the difference between an interface and an abstract class, and when would you choose one over the othe

Medium · Object-Oriented Design & Architecture

What is the difference between an interface and an abstract class, and when would you choose one over the other?

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 design a system to ensure it is highly configurable without requiring constant code redeployments?

Medium · Object-Oriented Design & 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?

Describe a design pattern you frequently use. What problem does it solve, and what are its trade-offs?

Medium · Object-Oriented Design & 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?

How do you approach refactoring a tightly coupled codebase to improve its testability?

Medium · Object-Oriented Design & 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 me through a major software project you contributed to (such as a previous role or internship). What was

Medium · Project Walkthroughs & Experience

Walk me through a major software project you contributed to (such as a previous role or internship). What was your specific architectural contribution?

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 comfortable are you working with and navigating a large, complex, in-house codebase that you did not write

Medium · Project Walkthroughs & Experience

How comfortable are you working with and navigating a large, complex, in-house codebase that you did not write?

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Describe a technical challenge you faced in a past project. What options did you consider, and why did you cho

Medium · Project Walkthroughs & Experience

Describe a technical challenge you faced in a past project. What options did you consider, and why did you choose your final solution?

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. 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 balance the pressure to deliver features quickly with the need to maintain high code quality and mi

Medium · Project Walkthroughs & Experience

How do you balance the pressure to deliver features quickly with the need to maintain high code quality and minimize technical debt?

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Walk me through your step-by-step process for debugging a complex, intermittent issue in a production environm

Medium · Technical Problem-Solving & Debugging

Walk me through your step-by-step process for debugging a complex, intermittent issue in a production environment.

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

  • What would you look at first, and what would it rule out?
  • How would you tell a cause from a coincidence here?

How do you write unit tests for code that relies heavily on external dependencies or third-party APIs?

Medium · Technical Problem-Solving & Debugging

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

  • What would you look at first, and what would it rule out?
  • How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Insurity candidates report.

Day 1 — Map the Insurity loop

  • Write out the reported sequence: Recruiter Call, Technical Evaluations, Final 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.

Day 2 — Work Object-Oriented Design (OOD)

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

Deliverable: One timed worked example in Object-Oriented Design (OOD).

Day 3 — Work Programming Fundamentals

  • Spend the session on Programming Fundamentals, which Insurity candidates report being tested on.
  • Write one worked example in Programming Fundamentals and time yourself on it.

Deliverable: One timed worked example in Programming Fundamentals.

Day 4 — Work Data Structures

  • Spend the session on Data Structures, which Insurity candidates report being tested on.
  • Write one worked example in Data Structures and time yourself on it.

Deliverable: One timed worked example in Data Structures.

Day 5 — Answer out loud: Object-Oriented Design & Architecture

  • Answer aloud, timed: Explain the core principles of Object-Oriented Design (OOD). How have you applied these principles in your past projects?
  • Answer aloud, timed: What is the difference between an interface and an abstract class, and when would you choose one over the other?

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

Day 6 — Answer out loud: Technical Problem-Solving & Debugging

  • Answer aloud, timed: Walk me through your step-by-step process for debugging a complex, intermittent issue in a production environment.
  • Answer aloud, timed: How do you determine which data structure (e.g., a hash map versus a list) is most appropriate for a specific performance-critical task?

Deliverable: Spoken answers to 2 reported Technical Problem-Solving & Debugging question(s), under time.

Day 7 — Answer out loud: Project Walkthroughs & Experience

  • Answer aloud, timed: Walk me through a major software project you contributed to (such as a previous role or internship). What was your specific architectural contribution?
  • Answer aloud, timed: How comfortable are you working with and navigating a large, complex, in-house codebase that you did not write?

Deliverable: Spoken answers to 2 reported Project Walkthroughs & 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 optimize the performance of a slow-running database query or application modul

Medium · Technical Problem-Solving & Debugging

Describe a time when you had to optimize the performance of a slow-running database query or application module.

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 working in the InsurTech space with Insurity?

Medium · Behavioral & Team 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?

Describe a situation where you had a strong technical disagreement with a team member or architect. How did yo

Medium · Behavioral & Team Collaboration

Describe a situation where you had a strong technical disagreement with a team member or architect. How did you 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 handle a situation where the requirements for a feature are ambiguous or not fully finalized?

Medium · Behavioral & Team 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 had to learn a new technology or domain-specific language very quickly to meet a proj

Medium · Behavioral & Team Collaboration

Tell me about a time you had to learn a new technology or domain-specific language very quickly to meet a project deadline.

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?