cswork / libraryOpen practice workspace

Interview guides · Clever

Clever Software Engineer Interview Guide

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

The 60-second brief

Clever hires Software Engineers; this guide collects what candidates report about the process.

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

Focus areas

  • Algorithms & data structures
  • Scalability analysis
  • Programming fundamentals

The Clever interview process

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

Online Application

Candidates begin the process by submitting an online application or completing an open API challenge.

What to demonstrate

  • Candidates begin the process by submitting an online application or completing an open API challenge
  • Depth in Algorithms & data structures

How to prepare

  • Answer aloud and timed: Focuses on your core programming proficiency, ability to handle edge cases, and your approach to collaborative pair programming or timed coding evaluations.
  • Answer aloud and timed: Write a program that interacts with the Clever open API and report its results.

Recruiter Screen

A preliminary screening conducted by a recruiter to assess candidate qualifications.

What to demonstrate

  • A preliminary screening conducted by a recruiter to assess candidate qualifications
  • Depth in Algorithms & 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.

Hiring Manager Screen

A discussion with the hiring manager to evaluate fit for the role.

What to demonstrate

  • A discussion with the hiring manager to evaluate fit for the role
  • Depth in Algorithms & 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.

Technical Screens

Candidates undergo technical interviews to assess their coding and problem-solving skills.

What to demonstrate

  • Candidates undergo technical interviews to assess their coding and problem-solving skills
  • Depth in Algorithms & data structures

How to prepare

  • Answer aloud and timed: Design a distributed system for a given product-relevant scenario with vague requirements.
  • Answer aloud and timed: Conceptualize a new service, provide appropriate data structures, and scale a naive solution into an optimal one.

Take-Home Exercise

Candidates may be assigned a take-home exercise or online assessment to demonstrate their technical abilities.

What to demonstrate

  • Candidates may be assigned a take-home exercise or online assessment to demonstrate their technical abilities
  • Depth in Algorithms & data structures

How to prepare

  • Answer aloud and timed: Discuss scalability aspects of a proposed solution and how it performs as input data size grows.
  • Answer aloud and timed: Explores how you collaborate with peers, navigate ambiguity, and align with Clever core values.

Virtual Onsite Loop

A comprehensive virtual onsite consisting of multiple rounds focusing on technical, architectural, and behavioral evaluations.

What to demonstrate

  • A comprehensive virtual onsite consisting of multiple rounds focusing on technical, architectural, and behavioral evaluations
  • Depth in Algorithms & data structures

How to prepare

  • Answer aloud and timed: Tell me about a time you worked closely with non-engineering stakeholders, such as product managers or business teams.
  • Answer aloud and timed: How do you handle disagreements on technical direction within a team?

Where candidates lose points

Think out loud continuously

Interviewers at Clever want to understand your mental model. Never code in silence; verbalize your hypotheses, trade-offs, and why you chose a particular approach.

Start naive and optimize

When presented with a coding or design problem, resist the urge to jump straight to the most complex solution. Start with a working baseline and iterate toward an optimal design.

Embrace the collaborative spirit

Treat pair programming and architectural discussions as collaborative teamwork rather than an interrogation. Show that you listen to hints and build constructively on feedback.

Align with user impact

Keep the end user—teachers, students, and administrators—in mind when discussing system design or product decisions. Demonstrating product empathy sets top candidates apart.

Questions & practice

Focuses on your core programming proficiency, ability to handle edge cases, and your approach to collaborative

Medium · Technical & Coding Assessments

Focuses on your core programming proficiency, ability to handle edge cases, and your approach to collaborative pair programming or timed coding evaluations.

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 LeetCode medium algorithmic problem dealing with recursion and data structures.

Medium · Technical & Coding Assessments

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?

Build out functionality for an uncommon data structure during a live coding session.

Medium · Technical & Coding Assessments

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?

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?

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?

Write a program that interacts with the Clever open API and report its results.

Medium · Technical & Coding Assessments

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?

Debug and write functions to integrate with API endpoints under time constraints.

Medium · Technical & Coding Assessments

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?

Tests your ability to conceptualize distributed systems, design data structures, and evaluate trade-offs.

Medium · System Design & 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 distributed system for a given product-relevant scenario with vague requirements.

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

Conceptualize a new service, provide appropriate data structures, and scale a naive solution into an optimal o

Medium · System Design & Architecture

Conceptualize a new service, provide appropriate data structures, and scale a naive solution into an optimal one.

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?

Discuss scalability aspects of a proposed solution and how it performs as input data size grows.

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

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

Day 1 — Map the Clever loop

  • Write out the reported sequence: Online Application, Recruiter Screen, Hiring Manager Screen, Technical Screens, Take-Home Exercise, Virtual Onsite Loop.
  • 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 6 reported rounds, with the weakest marked.

Day 2 — Work Algorithms & data structures

  • Spend the session on Algorithms & data structures, which Clever candidates report being tested on.
  • Write one worked example in Algorithms & data structures and time yourself on it.

Deliverable: One timed worked example in Algorithms & data structures.

Day 3 — Work Scalability analysis

  • Spend the session on Scalability analysis, which Clever candidates report being tested on.
  • Write one worked example in Scalability analysis and time yourself on it.

Deliverable: One timed worked example in Scalability analysis.

Day 4 — Work Programming fundamentals

  • Spend the session on Programming fundamentals, which Clever 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 5 — Answer out loud: Technical & Coding Assessments

  • Answer aloud, timed: Focuses on your core programming proficiency, ability to handle edge cases, and your approach to collaborative pair programming or timed coding evaluations.
  • Answer aloud, timed: Write a program that interacts with the Clever open API and report its results.

Deliverable: Spoken answers to 2 reported Technical & Coding Assessments question(s), under time.

Day 6 — Answer out loud: System Design & Architecture

  • Answer aloud, timed: Tests your ability to conceptualize distributed systems, design data structures, and evaluate trade-offs.
  • Answer aloud, timed: Design a distributed system for a given product-relevant scenario with vague requirements.

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

Day 7 — Answer out loud: Behavioral & Cultural Alignment

  • Answer aloud, timed: Explores how you collaborate with peers, navigate ambiguity, and align with Clever core values.
  • Answer aloud, timed: Tell me about a time you worked closely with non-engineering stakeholders, such as product managers or business teams.

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.

Explores how you collaborate with peers, navigate ambiguity, and align with Clever core values.

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?

Tell me about a time you worked closely with non-engineering stakeholders, such as product managers or busines

Medium · Behavioral & Cultural Alignment

Tell me about a time you worked closely with non-engineering stakeholders, such as product managers or business teams.

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 on technical direction within a team?

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?

Share an example of a past project where you had to balance speed and technical debt.

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?