Provenir Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Provenir, you will play a critical role in developing and scaling the company’s industry-leading, AI-powered decisioning platform. Provenir helps financial institutions, fintechs, and credit providers worldwide automate complex risk decisions in real time. Because the platform handles millions of transactions daily, your contributions will directly impact how quickly and securely consumers access credit, loans, and other financial services globally. The engineering team at Provenir focuses on building high-performance, low-latency, and highly secure software. You will work on a mix of robust backend data integration pipelines, sophisticated decision engines, and intuitive low-code user interfaces.

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

Focus areas

• Angular Framework
• Live Coding / Writing Code for a Full App
• Authentication / Auth Flows

The Provenir interview process

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

Recruiter Call

Initial screening call with a recruiter to discuss your background, career goals, and alignment with the role.

What to demonstrate

• Initial screening call with a recruiter to discuss your background, career goals, and alignment with the role
• Depth in Angular Framework

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 Screening

Technical screening call or conversation with the engineering team to assess core programming skills and domain expertise.

What to demonstrate

• Technical screening call or conversation with the engineering team to assess core programming skills and domain expertise
• Depth in Angular Framework

How to prepare

• Answer aloud and timed: Walk us through your approach to designing a responsive UI/UX for a complex, data-heavy dashboard.
• Answer aloud and timed: How do you handle component lifecycle hooks and change detection optimization in modern frontend frameworks?

Practical Coding Task

Complete a practical coding task or take-home assignment simulating real-world challenges at Provenir.

What to demonstrate

• Complete a practical coding task or take-home assignment simulating real-world challenges at Provenir
• Depth in Angular Framework

How to prepare

• Answer aloud and timed: Design a real-time decisioning engine that can process incoming transactional data with sub-second latency.
• Answer aloud and timed: How would you structure a scalable API gateway to handle authentication, rate limiting, and request routing?

Technical Interviews

Participate in deep-dive technical interviews to present your code and explain architectural choices.

What to demonstrate

• Participate in deep-dive technical interviews to present your code and explain architectural choices
• Depth in Angular Framework

How to prepare

• Answer aloud and timed: Explain the trade-offs between monolithic and microservices architectures, and how you decide which to use for a new product feature.
• Answer aloud and timed: How would you design a system to ensure zero data loss during high-volume message ingestion?

Where candidates lose points

Document your architectural decisions

When completing the practice task, write a brief README explaining your technical choices, assumptions, trade-offs, and how you would scale the application. This shows proactive communication and structured thinking.

Over-communicate during live sessions

During screen-share interviews or code walkthroughs, explain your thought process out loud. It is much easier for interviewers to evaluate your problem-solving skills when they can follow your logical progression.

Brush up on security fundamentals

Because Provenir operates in the financial technology sector, security is paramount. Be ready to discuss how you secure APIs, protect sensitive user data, and implement secure authentication flows.

Questions & practice

Explain, line-by-line, the implementation choices and algorithmic complexity of your submitted practice task.

Medium · Coding & Practical Problem Solving

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?

Track a rolling failure rate per destination for circuit decisions

Easy · sliding window · ring buffer · circuit breaker

The egress service delivers about 1,500 webhooks per second across roughly 40,000 destinations, each call bounded by a 10 second timeout. Maintain, per destination, the failure rate over the trailing 60 seconds so a caller can ask before dispatch whether the circuit should open. Attempts arrive as (destination_id, finished_at_ms, outcome). Requirement: amortised O(1) per attempt, with total memory bounded by the destination count rather than by traffic. Give the structure, its exact memory, and the rule that stops a destination with three attempts from opening a circuit.

Approach

1. Name the exact-deque version and then reject it as the default. Holding timestamps and advancing a tail pointer past anything older than now minus 60 seconds is a correct two-pointer window at amortised O(1) per attempt, but its memory tracks in-window traffic, so one destination in a retry storm holds hundreds of thousands of entries while thousands of quiet destinations hold none.
2. Use a ring of 60 one-second buckets per destination, each bucket a pair of counters for attempts and failures. On an attempt, advance the ring by the elapsed whole seconds, zeroing at most min(elapsed, 60) buckets, then increment the head. That is amortised O(1) with a fixed footprint per destination.
3. State the footprint: 60 buckets times two 4-byte counters is 480 bytes of payload per destination, so 40,000 destinations is roughly 20 to 25 MB with per-entry overhead, bounded by the catalogue rather than by the rate. The cost is granularity, since the oldest bucket ages out in whole seconds, which is far tighter than the decision needs.
4. Require a minimum sample before the circuit may open. A destination with three attempts and three failures reads as 100 percent and is not evidence; a floor of roughly 20 attempts in the window makes the ratio meaningful, and below that floor use a run of consecutive failures as the trigger instead.

Follow-up

• The fleet is 30 instances and each sees roughly a thirtieth of a destination's traffic. Where does the rate actually live, and what does a per-instance answer get wrong?
• A destination answers in 9.5 seconds and succeeds. It is not failing but it is consuming your per-destination concurrency. What signal should open the circuit here?

Canonicalise a request body into a stable idempotency fingerprint

Medium · parsing · canonicalisation · hashing

idempotency_key.request_fingerprint is a SHA-256 over the method, path and canonicalised body, and a retry whose fingerprint differs must be rejected with 422 rather than served the stored response. Write the canonicaliser. Bodies are JSON up to 256 KB nested at most 32 levels; clients vary key order, whitespace and unicode escaping, and some send 64-bit ids as JSON numbers. Produce a deterministic byte string such that semantically identical bodies match and any semantic difference does not. State your complexity and name two normalisations you refuse to perform.

Approach

1. Parse once into a tree, then re-serialise under fixed rules: object keys sorted, array order preserved, one escaping convention, no insignificant whitespace. Parsing is O(n) and sorting keys is O(k log k) per object, so O(n log n) overall with O(depth) stack, and the 32-level cap is enforced during parsing because hostile nesting is how a canonicaliser becomes a stack overflow.
2. Sort keys by their UTF-8 bytes and say why the obvious implementation is wrong in some runtimes: a default string comparison that orders by UTF-16 code units places surrogate pairs, meaning code points from U+10000 up, below U+E000 to U+FFFF, which is not UTF-8 byte order, so two services written in different languages disagree on the same document.
3. Do not re-encode numbers through a double. IEEE-754 binary64 represents integers exactly only up to 2^53, so normalising a 19-digit id through a float changes it, and 1 against 1.0 cannot be reconciled without deciding whether they are the same value. Preserve the literal token, and require ids as strings at the API boundary if you want them comparable.
4. Reject duplicate keys rather than picking one. JSON permits them and parsers disagree, most keeping the last, so any choice you make ties the fingerprint to a parser detail that the code handling the request does not necessarily share.

Follow-up

• A client sends the same logical request with an extra field your API ignores. Same key, different fingerprint, so you return 422. Is that the right answer?
• Where does the fingerprint get computed relative to request decompression and the body-size limit?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

• 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
• A dashboard runs this for 40 owners in one page load. What changes about the design?

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?

How would you architect a single-page application from scratch using Angular, ensuring proper state management

Medium · Frontend & UI Architecture

How would you architect a single-page application from scratch using Angular, ensuring proper state management and performance?

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?

Explain how you would implement secure user authentication and session management in a frontend application.

Medium · Frontend & UI 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 us through your approach to designing a responsive UI/UX for a complex, data-heavy dashboard.

Medium · Frontend & UI 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?

Design a real-time decisioning engine that can process incoming transactional data with sub-second latency.

Medium · System Design & Backend 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 would you structure a scalable API gateway to handle authentication, rate limiting, and request routing?

Medium · System Design & Backend Architecture

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?

Explain the trade-offs between monolithic and microservices architectures, and how you decide which to use for

Medium · System Design & Backend Architecture

Explain the trade-offs between monolithic and microservices architectures, and how you decide which to use for a new product feature.

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 would you design a system to ensure zero data loss during high-volume message ingestion?

Medium · System Design & Backend 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 us through a complex codebase you recently wrote. What architectural patterns did you choose, and why?

Medium · Coding & Practical Problem Solving

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?

Write a functional application or module that integrates with a third-party API, parses the response, and rend

Medium · Coding & Practical Problem Solving

Write a functional application or module that integrates with a third-party API, parses the response, and renders it securely on the UI.

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 do you approach debugging a memory leak in a production application?

Medium · Coding & Practical Problem Solving

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 Provenir candidates report.

Day 1 — Map the Provenir loop

• Write out the reported sequence: Recruiter Call, Technical Screening, Practical Coding Task, 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 4 reported rounds, with the weakest marked.

Day 2 — Work Angular Framework

• Spend the session on Angular Framework, which Provenir candidates report being tested on.
• Write one worked example in Angular Framework and time yourself on it.

Deliverable: One timed worked example in Angular Framework.

Day 3 — Work Live Coding / Writing Code for a Full App

• Spend the session on Live Coding / Writing Code for a Full App, which Provenir candidates report being tested on.
• Write one worked example in Live Coding / Writing Code for a Full App and time yourself on it.

Deliverable: One timed worked example in Live Coding / Writing Code for a Full App.

Day 4 — Work Authentication / Auth Flows

• Spend the session on Authentication / Auth Flows, which Provenir candidates report being tested on.
• Write one worked example in Authentication / Auth Flows and time yourself on it.

Deliverable: One timed worked example in Authentication / Auth Flows.

Day 5 — Answer out loud: Frontend & UI Architecture

• Answer aloud, timed: How would you architect a single-page application from scratch using Angular, ensuring proper state management and performance?
• Answer aloud, timed: Explain how you would implement secure user authentication and session management in a frontend application.

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

Day 6 — Answer out loud: System Design & Backend Architecture

• Answer aloud, timed: Design a real-time decisioning engine that can process incoming transactional data with sub-second latency.
• Answer aloud, timed: How would you structure a scalable API gateway to handle authentication, rate limiting, and request routing?

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

Day 7 — Answer out loud: Coding & Practical Problem Solving

• Answer aloud, timed: Walk us through a complex codebase you recently wrote. What architectural patterns did you choose, and why?
• Answer aloud, timed: How do you approach debugging a memory leak in a production application?

Deliverable: Spoken answers to 2 reported Coding & Practical Problem Solving question(s), under time.

Behavioural preparation

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

How do you handle component lifecycle hooks and change detection optimization in modern frontend frameworks?

Medium · Frontend & UI 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?

Tell me about a time when you had to deliver a critical feature under a tight deadline. How did you manage tec

Medium · Behavioral & Professional Alignment

Tell me about a time when you had to deliver a critical feature under a tight deadline. How did you manage technical debt?

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 constructive feedback or pushback on your architectural designs from senior stakeholders?

Medium · Behavioral & Professional Alignment

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 joining Provenir, and how do you stay updated with the latest trends in financial te

Medium · Behavioral & Professional Alignment

Why are you interested in joining Provenir, and how do you stay updated with the latest trends in financial technology and software engineering?

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 to collaborate with a non-technical manager or stakeholder to define techni

Medium · Behavioral & Professional Alignment

Describe a situation where you had to collaborate with a non-technical manager or stakeholder to define technical requirements.

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?