Givzey Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Givzey plays a pivotal role in revolutionizing the fundraising landscape. As a pioneering financial technology platform dedicated to the nonprofit sector, Givzey introduces flexible giving solutions, such as "Give Now, Pay Later" (GNPL), donor-managed accounts, and automated giving pipelines. In this role, you will build and scale the secure, high-performance infrastructure that bridges the gap between passionate donors and impactful nonprofit organizations. Whether your focus is as a Systems Engineer, Full Stack Engineer, Front End Engineer, or Web Developer, your work directly impacts how millions of dollars are processed, tracked, and deployed. You will tackle complex challenges surrounding transactional integrity, real-time ledger management, and seamless donor user experiences.

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

Focus areas

• Full-Stack Development
• Front-End Development
• Web Application Development

The Givzey interview process

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

Initial Conversation

Align on career goals and company culture.

What to demonstrate

• Align on career goals and company culture
• Depth in Full-Stack Development

How to prepare

• Answer aloud and timed: Implement a function to calculate payment schedules for a flexible giving plan, accounting for custom frequencies and leap years.
• Answer aloud and timed: Write a function that takes an array of donor transactions and groups them by campaign, returning the top three campaigns by total volume.

Technical Capabilities Assessment

Evaluate your technical skills through practical engineering scenarios.

What to demonstrate

• Evaluate your technical skills through practical engineering scenarios
• Depth in Full-Stack Development

How to prepare

• Answer aloud and timed: Given an API response containing nested organization data, write a utility to flatten the data structure for efficient frontend rendering.
• Answer aloud and timed: Design an algorithm to detect duplicate donor profiles based on matching names, emails, and fuzzy-matched addresses.

Team Interactions

Engage with various members of the engineering, product, and leadership teams.

What to demonstrate

• Engage with various members of the engineering, product, and leadership teams
• Depth in Full-Stack Development

How to prepare

• Answer aloud and timed: Design a secure, idempotent payment processing system that integrates with third-party gateways like Stripe.
• Answer aloud and timed: How would you architect a real-time notification system to alert fundraisers when a high-value donor completes a pledge?

Feedback and Questions

Receive prompt feedback and discuss your questions about the company.

What to demonstrate

• Receive prompt feedback and discuss your questions about the company
• Depth in Full-Stack Development

How to prepare

• Answer aloud and timed: Design the database schema for a flexible giving platform that supports recurring donations, split-campaign payouts, and multi-tenant access control.
• Answer aloud and timed: How would you design a rate-limiting mechanism to protect public-facing donation widgets from automated card-testing attacks?

System Design and Collaboration

Deep dive into system design and evaluate cross-functional collaboration.

What to demonstrate

• Deep dive into system design and evaluate cross-functional collaboration
• Depth in Full-Stack Development

How to prepare

• Answer aloud and timed: Tell me about a time you had to make a technical trade-off to meet a tight product deadline. What was the outcome?
• Answer aloud and timed: How do you handle disagreements with product managers or designers regarding the implementation details of a feature?

Where candidates lose points

Think like a product owner

When writing code or designing a system, always relate your decisions back to the user experience. Ask yourself: How does this database schema affect page load times for a donor on a mobile connection?

Prioritize simplicity over cleverness

Write clean, readable code. Avoid over-engineering solutions to simple problems during coding assessments. A simple, working, and well-tested solution is always preferred over an incomplete, overly complex one.

Avoid skipping error handling in your coding sessions

At a fintech startup like Givzey, handling failures gracefully is just as important as writing the happy path.

Questions & practice

Implement a function to calculate payment schedules for a flexible giving plan, accounting for custom frequenc

Medium · Coding & Algorithmic Problem Solving

Implement a function to calculate payment schedules for a flexible giving plan, accounting for custom frequencies and leap years.

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 function that takes an array of donor transactions and groups them by campaign, returning the top thre

Medium · Coding & Algorithmic Problem Solving

Write a function that takes an array of donor transactions and groups them by campaign, returning the top three campaigns by total volume.

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?

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?

Design the database schema for a flexible giving platform that supports recurring donations, split-campaign pa

Medium · System Design & Architecture

Design the database schema for a flexible giving platform that supports recurring donations, split-campaign payouts, and multi-tenant access control.

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?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.

Approach

1. Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
2. Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
3. Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
4. Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.

Follow-up

• The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
• A resource can be shared with the same user twice under different permissions. Does your count change, and should it?

Given an API response containing nested organization data, write a utility to flatten the data structure for e

Medium · Coding & Algorithmic Problem Solving

Given an API response containing nested organization data, write a utility to flatten the data structure for efficient frontend rendering.

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?

Design an algorithm to detect duplicate donor profiles based on matching names, emails, and fuzzy-matched addr

Medium · Coding & Algorithmic Problem Solving

Design an algorithm to detect duplicate donor profiles based on matching names, emails, and fuzzy-matched addresses.

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 secure, idempotent payment processing system that integrates with third-party gateways like Stripe.

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

How would you architect a real-time notification system to alert fundraisers when a high-value donor completes

Medium · System Design & Architecture

How would you architect a real-time notification system to alert fundraisers when a high-value donor completes a pledge?

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 rate-limiting mechanism to protect public-facing donation widgets from automated card-t

Medium · System Design & Architecture

How would you design a rate-limiting mechanism to protect public-facing donation widgets from automated card-testing attacks?

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 situation where you had to debug a critical production issue under pressure. How did you communicat

Medium · Behavioral & Cultural Alignment

Describe a situation where you had to debug a critical production issue under pressure. How did you communicate with stakeholders?

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

Day 1 — Map the Givzey loop

• Write out the reported sequence: Initial Conversation, Technical Capabilities Assessment, Team Interactions, Feedback and Questions, System Design and Collaboration.
• 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 Full-Stack Development

• Spend the session on Full-Stack Development, which Givzey candidates report being tested on.
• Write one worked example in Full-Stack Development and time yourself on it.

Deliverable: One timed worked example in Full-Stack Development.

Day 3 — Work Front-End Development

• Spend the session on Front-End Development, which Givzey candidates report being tested on.
• Write one worked example in Front-End Development and time yourself on it.

Deliverable: One timed worked example in Front-End Development.

Day 4 — Work Web Application Development

• Spend the session on Web Application Development, which Givzey candidates report being tested on.
• Write one worked example in Web Application Development and time yourself on it.

Deliverable: One timed worked example in Web Application Development.

Day 5 — Answer out loud: Coding & Algorithmic Problem Solving

• Answer aloud, timed: Implement a function to calculate payment schedules for a flexible giving plan, accounting for custom frequencies and leap years.
• Answer aloud, timed: Write a function that takes an array of donor transactions and groups them by campaign, returning the top three campaigns by total volume.

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

Day 6 — Answer out loud: System Design & Architecture

• Answer aloud, timed: Design a secure, idempotent payment processing system that integrates with third-party gateways like Stripe.
• Answer aloud, timed: How would you architect a real-time notification system to alert fundraisers when a high-value donor completes a pledge?

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

Day 7 — Answer out loud: Behavioral & Cultural Alignment

• Answer aloud, timed: Tell me about a time you had to make a technical trade-off to meet a tight product deadline. What was the outcome?
• Answer aloud, timed: How do you handle disagreements with product managers or designers regarding the implementation details of a feature?

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

Behavioural preparation

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. What was the outc

Medium · Behavioral & Cultural Alignment

Tell me about a time you had to make a technical trade-off to meet a tight product deadline. What was the outcome?

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 disagreements with product managers or designers regarding the implementation details of a f

Medium · Behavioral & Cultural Alignment

How do you handle disagreements with product managers or designers regarding the implementation details of a feature?

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 building financial technology specifically for the nonprofit sector?

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