cswork / libraryOpen practice workspace

Interview guides · Givelify

Givelify Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Givelify, you are at the heart of a mission-driven organization dedicated to transforming the way people support the causes they care about. This role is not just about writing code; it is about building reliable, high-performance systems that facilitate real-time financial transactions and foster meaningful connections between donors and the organizations they support. You will be tasked with solving complex problems that require a deep understanding of mobile application architecture, data synchronization, and scalable backend infrastructure. The impact of your work is direct and tangible. Every feature you build or system you optimize directly affects the ability of non-profits, places of worship, and charities to receive essential funding. You will operate in an environment where technical precision meets a high-growth, user-centric mission.

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

Focus areas

  • Problem Solving (Coding)
  • Data Structures & Algorithms
  • System Design (Data Sync / Real-time Updates)

The Givelify interview process

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

Initial Screening

Understand your background and alignment with Givelify's mission.

What to demonstrate

  • Understand your background and alignment with Givelify's mission
  • Depth in Problem Solving (Coding)

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 Assessment

Includes take-home assignments or live coding sessions to test coding skills.

What to demonstrate

  • Includes take-home assignments or live coding sessions to test coding skills
  • Depth in Problem Solving (Coding)

How to prepare

  • Answer aloud and timed: How would you design a system for mobile app data to sync in real-time with a backend that receives concurrent transactions from multiple devices?
  • Answer aloud and timed: Describe a challenging technical problem you solved and the specific steps you took to reach the solution.

Interviews with Team

Conversations with potential teammates, technical leads, and occasionally management.

What to demonstrate

  • Conversations with potential teammates, technical leads, and occasionally management
  • Depth in Problem Solving (Coding)

How to prepare

  • Answer aloud and timed: How do you handle edge cases when implementing complex data structures?
  • Answer aloud and timed: Tell me about your favorite project; explain it in detail.

Cultural Fit Discussion

Engage in discussions about tech stack, team dynamics, and engineering vision.

What to demonstrate

  • Engage in discussions about tech stack, team dynamics, and engineering vision
  • Depth in Problem Solving (Coding)

How to prepare

  • Answer aloud and timed: What are you most proud of in your technical career to date?
  • Answer aloud and timed: What was the most significant lesson you learned from a past technical failure?

Where candidates lose points

Be ready to talk about your code

Don't just provide a solution; explain why you chose a specific algorithm or data structure over alternatives.

Embrace the conversation

Our interviewers are interested in your thought process. Talk through your assumptions and ask clarifying questions if a prompt is ambiguous.

Research our mission

Understanding the impact Givelify has on non-profits can help you better align your answers with our company values.

Prepare your own questions

Use the time at the end of each interview to ask insightful questions about our engineering challenges and team culture.

Questions & practice

Explain your approach to finding the maximum length of a subset with a constant difference between consecutive

Medium · Technical Foundations and Problem Solvin

Explain your approach to finding the maximum length of a subset with a constant difference between consecutive elements.

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?

Describe a challenging technical problem you solved and the specific steps you took to reach the solution.

Medium · Technical Foundations and Problem Solvin

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?

How would you optimize the performance of a slow SQL query?

Medium · Technical Foundations and Problem Solvin

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?

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?

How would you design a system for mobile app data to sync in real-time with a backend that receives concurrent

Medium · Technical Foundations and Problem Solvin

How would you design a system for mobile app data to sync in real-time with a backend that receives concurrent transactions from multiple devices?

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 are you most proud of in your technical career to date?

Medium · Experience and Project Deep-Dives

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?

What was the most significant lesson you learned from a past technical failure?

Medium · Experience and Project Deep-Dives

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?

Edge instances grow 400 MB per hour until the nightly restart

Hard · memory leak · heap analysis · metric cardinality

Edge API instances start at 700 MB resident and grow about 400 MB/hour; a nightly rolling restart has hidden it for weeks. Growth continues unchanged when request rate halves overnight, p99 degrades in the last hours before an instance is recycled, and heap used immediately after a forced full GC rises monotonically. The service holds no product state. Name the discriminating measurement that separates the plausible causes, give the most likely cause, and give the fix and how you would verify it.

Approach

  1. Separate resident memory from live heap first, because they fail differently. Resident size can grow from fragmentation, native buffers or thread stacks while the heap is flat; heap used after a full GC rising monotonically is the measurement that says objects are reachable and not being released. You already have it, so this is retention, not fragmentation, and that closes off half the candidate list.
  2. Use the rate's independence from traffic as the discriminator. Growth that continues at half the request rate rules out per-request objects that are merely slow to collect and points at a structure that grows with distinct values observed rather than with call volume. Write the candidates that have that property: a metrics registry keyed on a high-cardinality label, an unevicted cache, an interner, a per-key lock map.
  3. Take two heap snapshots an hour apart and diff by retained size, reading the dominator tree, not by allocation count or instance count. Expect one root holding a map with millions of entries, then follow the reference chain to the code that inserts and never removes. Allocation profilers point at churn, which is the wrong signal here.
  4. The candidate that fits this service is an observability label carrying an identifier, such as a request path recorded before templating so that /v1/resources/48213 becomes its own metric series. That grows with distinct ids seen, is independent of rate, and explains the late p99 degradation, since GC cost rises with the size of the live set.

Follow-up

  • Post-GC heap is now flat but resident size still creeps. What are you looking at, and does it matter?
  • How would you have detected this before an OOM, given the nightly restart masked the trend?

Suggested practice checklist

Built from the rounds and topics Givelify candidates report.

Day 1 — Map the Givelify loop

  • Write out the reported sequence: Initial Screening, Technical Assessment, Interviews with Team, Cultural Fit Discussion.
  • 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 Problem Solving (Coding)

  • Spend the session on Problem Solving (Coding), which Givelify candidates report being tested on.
  • Write one worked example in Problem Solving (Coding) and time yourself on it.

Deliverable: One timed worked example in Problem Solving (Coding).

Day 3 — Work Data Structures & Algorithms

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

Deliverable: One timed worked example in Data Structures & Algorithms.

Day 4 — Work System Design (Data Sync / Real-time Updates)

  • Spend the session on System Design (Data Sync / Real-time Updates), which Givelify candidates report being tested on.
  • Write one worked example in System Design (Data Sync / Real-time Updates) and time yourself on it.

Deliverable: One timed worked example in System Design (Data Sync / Real-time Updates).

Day 5 — Answer out loud: Technical Foundations and Problem Solving

  • Answer aloud, timed: How would you optimize the performance of a slow SQL query?
  • Answer aloud, timed: Explain your approach to finding the maximum length of a subset with a constant difference between consecutive elements.

Deliverable: Spoken answers to 2 reported Technical Foundations and Problem Solving question(s), under time.

Day 6 — Answer out loud: Experience and Project Deep-Dives

  • Answer aloud, timed: Tell me about your favorite project; explain it in detail.
  • Answer aloud, timed: What are you most proud of in your technical career to date?

Deliverable: Spoken answers to 2 reported Experience and Project Deep-Dives question(s), under time.

Day 7 — Dry run for Givelify

  • Run one full mock under time, then write down the two questions you most want to ask your interviewers.

Deliverable: A completed timed mock and two questions to ask.

Behavioural preparation

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

How do you handle edge cases when implementing complex data structures?

Medium · Technical Foundations and Problem Solvin

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 your favorite project; explain it in detail.

Medium · Experience and Project Deep-Dives

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 your experience with automation and how you have utilized it in past roles.

Medium · Experience and Project Deep-Dives

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 yourself and your professional journey.

Medium · Experience and Project Deep-Dives

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?