cswork / libraryOpen practice workspace

Interview guides · Paysafe

Paysafe Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Paysafe plays a critical role in powering the global economy by building, scaling, and securing the payment solutions that millions of merchants and consumers rely on daily. From digital wallets like Skrill and Neteller to eCash solutions like paysafecard, the engineering team is responsible for processing billions of dollars in transactions securely and seamlessly. This requires a deep focus on high availability, microservices architecture, and low-latency systems. As a developer in this space, you will work on complex, high-throughput systems where security and performance cannot be compromised. You will be tasked with solving intricate problems around real-time data streaming, robust database design, and secure API integrations.

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

Focus areas

  • Data Structures
  • Problem Solving
  • System Design

The Paysafe interview process

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

HR Screening

Initial discussion about your background and motivation.

What to demonstrate

  • Initial discussion about your background and motivation
  • Depth in Data Structures

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 Technical Assessment

Assessment on HackerRank to test core coding and problem-solving abilities.

What to demonstrate

  • Assessment on HackerRank to test core coding and problem-solving abilities
  • Depth in Data Structures

How to prepare

  • Answer aloud and timed: Given a binary tree, find its maximum depth and check if it is height-balanced.
  • Answer aloud and timed: Write an algorithm to detect a cycle in a directed graph.

Technical Rounds

Deep dives into coding, object-oriented concepts, and system architecture.

What to demonstrate

  • Deep dives into coding, object-oriented concepts, and system architecture
  • Depth in Data Structures

How to prepare

  • Answer aloud and timed: Solve a dynamic programming problem involving finding the minimum number of coins required to make change.
  • Answer aloud and timed: Explain the difference between an abstract class and an interface, and when you would use each.

Hiring Manager Discussion

Final discussion with the hiring manager regarding your fit for the team.

What to demonstrate

  • Final discussion with the hiring manager regarding your fit for the team
  • Depth in Data Structures

How to prepare

  • Prepare two projects you led end to end, each with the decision you owned and what it cost.
  • Have three questions about the team's roadmap and how success is measured in the first six months.

HR Round

Final round to discuss team fit and compensation.

What to demonstrate

  • Final round to discuss team fit and compensation
  • Depth in Data Structures

How to prepare

  • Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
  • Re-read the description of the hr round above and write down what you would ask to confirm before it.

Where candidates lose points

Be precise but flexible

During technical discussions, some interviewers may look for specific terminology or "by-the-book" answers. Be precise in your explanations, but remain open and collaborative if they guide you toward a different approach.

Focus on the "working" aspect of LLD

In low-level design rounds, interviewers often expect to see a working application in your IDE. Prioritize getting a simple, working version running with basic scenarios before trying to over-engineer complex design patterns.

Assuming the input fits in memory

Ask how large the input is in bytes before committing to an in-memory algorithm; beyond that point the options are a single streaming pass, an external sort with bounded buffers, or a sketch that trades exactness for constant memory. An algorithm that assumes random access to the whole input is a different algorithm from one that sees each element once.

Questions & practice

Implement an LRU (Least Recently Used) cache with efficient lookup and insertion times.

Medium · Data Structures & Algorithms

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?

Write a program to reverse a singly linked list, both iteratively and recursively.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Given a binary tree, find its maximum depth and check if it is height-balanced.

Medium · Data Structures & Algorithms

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?

Write an algorithm to detect a cycle in a directed graph.

Medium · Data Structures & Algorithms

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 dynamic programming problem involving finding the minimum number of coins required to make change.

Medium · Data Structures & Algorithms

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 an abstract class and an interface, and when you would use each.

Medium · Object-Oriented Programming & Language F

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?

How does garbage collection work in Java, and what are the different memory areas (Heap vs. Stack)?

Medium · Object-Oriented Programming & Language F

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?

Describe the collections framework in your primary language and explain the internal working of a HashMap.

Medium · Object-Oriented Programming & Language F

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?

What is multithreading, and how do you handle thread safety and synchronization in a high-concurrency environm

Medium · Object-Oriented Programming & Language F

What is multithreading, and how do you handle thread safety and synchronization in a high-concurrency environment?

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?

Explain the SOLID design principles with concrete code examples.

Medium · Object-Oriented Programming & Language F

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?

Why do you want to join Paysafe, and what interests you about the fintech and payments domain?

Medium · Behavioral & Experience

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

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

Approach

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

Follow-up

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

Design a low-level application (LLD) on an IDE, ensuring proper class structure, interfaces, and working scena

Medium · System & Database Design

Design a low-level application (LLD) on an IDE, ensuring proper class structure, interfaces, and working scenarios.

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 database schema and API endpoints for a real-time payment tracking service?

Medium · System & Database Design

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?

When would you choose a NoSQL database like MongoDB over a relational database like PostgreSQL for a transacti

Medium · System & Database Design

When would you choose a NoSQL database like MongoDB over a relational database like PostgreSQL for a transaction-heavy service?

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 does Apache Kafka handle message partitioning and guarantee message delivery?

Medium · System & Database Design

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 rate limiter to protect public-facing payment APIs from abuse.

Medium · System & Database Design

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?

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

Day 1 — Map the Paysafe loop

  • Write out the reported sequence: HR Screening, Online Technical Assessment, Technical Rounds, Hiring Manager Discussion, HR Round.
  • 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 5 reported rounds, with the weakest marked.

Day 2 — Work Data Structures

  • Spend the session on Data Structures, which Paysafe 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 3 — Work Problem Solving

  • Spend the session on Problem Solving, which Paysafe 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 4 — Work System Design

  • Spend the session on System Design, which Paysafe candidates report being tested on.
  • Write one worked example in System Design and time yourself on it.

Deliverable: One timed worked example in System Design.

Day 5 — Answer out loud: Data Structures & Algorithms

  • Answer aloud, timed: Implement an LRU (Least Recently Used) cache with efficient lookup and insertion times.
  • Answer aloud, timed: Write a program to reverse a singly linked list, both iteratively and recursively.

Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.

Day 6 — Answer out loud: Object-Oriented Programming & Language Fundamentals

  • Answer aloud, timed: Explain the difference between an abstract class and an interface, and when you would use each.
  • Answer aloud, timed: How does garbage collection work in Java, and what are the different memory areas (Heap vs. Stack)?

Deliverable: Spoken answers to 2 reported Object-Oriented Programming & Language Fundamentals question(s), under time.

Day 7 — Answer out loud: System & Database Design

  • Answer aloud, timed: Design a low-level application (LLD) on an IDE, ensuring proper class structure, interfaces, and working scenarios.
  • Answer aloud, timed: How would you design a database schema and API endpoints for a real-time payment tracking service?

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

Behavioural preparation

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

Describe a difficult technical problem you faced in your previous job and how you went about solving it.

Medium · Behavioral & Experience

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 a disagreement with a technical lead or peer and how it was resolved.

Medium · Behavioral & Experience

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 shifting priorities and tight deadlines in an agile development environment?

Medium · Behavioral & Experience

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?