Leepfrog Technologies Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Leepfrog Technologies plays a pivotal role in developing, refining, and scaling the company's flagship academic catalog and curriculum management solutions. Our engineering teams are directly responsible for building highly customizable, robust enterprise web applications that hundreds of higher education institutions rely on daily. Because our software serves as the backbone for university curriculum planning, the code you write directly impacts millions of students and academic administrators. In this role, you will work on complex, data-driven systems where customizability and reliability are paramount. The engineering challenges here do not just involve writing new features from scratch; they also require a deep understanding of how to refactor, upgrade, and maintain existing codebases to support evolving client requirements.

This guide is scoped to a Software Engineer candidate at Leepfrog Technologies.

Focus areas

• Programming fundamentals
• Coding interview preparation
• Problem solving

The Leepfrog Technologies interview process

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

Initial Screening Call

Discuss your background and interest in the company.

What to demonstrate

• Discuss your background and interest in the company
• Depth in Programming fundamentals

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 Interview

Focus on core programming logic and code extensibility.

What to demonstrate

• Focus on core programming logic and code extensibility
• Depth in Programming fundamentals

How to prepare

• Answer aloud and timed: Describe your approach to testing a basic logic function to ensure all edge cases are covered.
• Answer aloud and timed: How do you optimize nested loops or conditional statements for readability and performance?

Behavioral Interview

Evaluate behavioral fit and experiences, potentially in a group format.

What to demonstrate

• Evaluate behavioral fit and experiences, potentially in a group format
• Depth in Programming fundamentals

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 behavioral interview above and write down what you would ask to confirm before it.

Where candidates lose points

Focus on the 'Why'

When writing code during your technical interview, do not just focus on getting the code to compile. Explain your thought process, why you chose a specific loop or data structure, and how you would build upon it in the future.

Prepare for a Slower Pace

The hiring process can sometimes experience scheduling gaps. Stay patient, keep your communication professional, and use the time between rounds to refine your technical preparation.

Quoting amortised or average cost as if it were a worst-case guarantee

Appending to a dynamic array is amortised O(1), but the append that triggers a resize copies every element, and hash lookup is constant only while the hash spreads the actual keys. Say which guarantee you are offering when the caller cares about the latency of one call rather than the total over many.

Questions & practice

Write a standard implementation of the FizzBuzz algorithm.

Medium · Coding and Logic

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?

How would you modify your FizzBuzz solution to support new, arbitrary rules without rewriting the core logic?

Medium · Coding and Logic

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 your approach to testing a basic logic function to ensure all edge cases are covered.

Medium · Coding and Logic

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?

How do you optimize nested loops or conditional statements for readability and performance?

Medium · Coding and Logic

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 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?

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

1. Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
2. Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
3. Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
4. Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

• The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
• How do you verify the backfill actually finished, given rows are still being inserted while it runs?

Given a simple, working script, what steps would you take to make it modular and reusable?

Medium · Code Extensibility and Refactoring

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 trade-off between delivering a quick fix and implementing a highly scalable, abstract s

Medium · Code Extensibility and Refactoring

How do you balance the trade-off between delivering a quick fix and implementing a highly scalable, abstract solution?

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 design patterns do you rely on most when refactoring legacy code?

Medium · Code Extensibility and Refactoring

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?

Explain how you would structure an API to ensure backward compatibility when adding new features.

Medium · Code Extensibility and Refactoring

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?

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 Leepfrog Technologies candidates report.

Day 1 — Map the Leepfrog Technologies loop

• Write out the reported sequence: Initial Screening Call, Technical Interview, Behavioral Interview.
• 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 Programming fundamentals

• Spend the session on Programming fundamentals, which Leepfrog Technologies 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 3 — Work Coding interview preparation

• Spend the session on Coding interview preparation, which Leepfrog Technologies candidates report being tested on.
• Write one worked example in Coding interview preparation and time yourself on it.

Deliverable: One timed worked example in Coding interview preparation.

Day 4 — Work Problem solving

• Spend the session on Problem solving, which Leepfrog Technologies 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 5 — Answer out loud: Coding and Logic

• Answer aloud, timed: Write a standard implementation of the FizzBuzz algorithm.
• Answer aloud, timed: How would you modify your FizzBuzz solution to support new, arbitrary rules without rewriting the core logic?

Deliverable: Spoken answers to 2 reported Coding and Logic question(s), under time.

Day 6 — Answer out loud: Code Extensibility and Refactoring

• Answer aloud, timed: Given a simple, working script, what steps would you take to make it modular and reusable?
• Answer aloud, timed: How do you balance the trade-off between delivering a quick fix and implementing a highly scalable, abstract solution?

Deliverable: Spoken answers to 2 reported Code Extensibility and Refactoring question(s), under time.

Day 7 — Answer out loud: Behavioral and Past Experience

• Answer aloud, timed: Walk me through a challenging technical problem you solved in your previous role and why you chose that specific solution.
• Answer aloud, timed: How do you handle a situation where a project's requirements change mid-development?

Deliverable: Spoken answers to 2 reported Behavioral and Past Experience question(s), under time.

Behavioural preparation

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

Walk me through a challenging technical problem you solved in your previous role and why you chose that specif

Medium · Behavioral and Past Experience

Walk me through a challenging technical problem you solved in your previous role and why you chose that specific solution.

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 a project's requirements change mid-development?

Medium · Behavioral and Past 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?

Describe a time when you had to collaborate with a non-technical stakeholder to resolve a software issue.

Medium · Behavioral and Past 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 manage your time and stay productive when working on multiple parallel tasks?

Medium · Behavioral and Past 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?