cswork / libraryOpen practice workspace

Interview guides · Joko

Joko Software Engineer Interview Guide

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

The 60-second brief

At Joko, a Software Engineer is responsible for building and scaling a platform that redefines the daily shopping experience for millions of users. Joko integrates financial technology with consumer-facing features like cashback, centralized loyalty cards, and flexible payment options. As an engineer, you do not just write code; you build secure, high-performance systems that handle complex financial transactions, process large-scale data, and deliver a seamless mobile and web experience. The engineering team at Joko operates with a high degree of ownership. Whether you are working on backend microservices, optimizing data pipelines, or refining the mobile client, your work directly impacts user engagement and transaction security.

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

Focus areas

  • Technical interviewing
  • Coding problem solving
  • Take-home assignments

The Joko interview process

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

Initial Screening Call

A conversation with a recruiter, team lead, or VP of Engineering to assess mutual interest and verify understanding of Joko's business model.

What to demonstrate

  • A conversation with a recruiter, team lead, or VP of Engineering to assess mutual interest and verify understanding of Joko's business model
  • Depth in Technical interviewing

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.

Deep-Dive Technical Phase

Includes a take-home assignment or live coding session focusing on core computer science concepts, code structure, and security.

What to demonstrate

  • Includes a take-home assignment or live coding session focusing on core computer science concepts, code structure, and security
  • Depth in Technical interviewing

How to prepare

  • Answer aloud and timed: What features of the Joko app do you think could be improved from an engineering perspective?
  • Answer aloud and timed: How do you stay updated on consumer fintech trends?

Background Checks

Deep background checks of past engineering experiences conducted by the CTO or senior engineering leaders.

What to demonstrate

  • Deep background checks of past engineering experiences conducted by the CTO or senior engineering leaders
  • Depth in Technical interviewing

How to prepare

  • Answer aloud and timed: How would you design a secure system to track and validate user cashback transactions from third-party partners?
  • Answer aloud and timed: What security measures would you implement when handling sensitive financial or banking APIs?

Cultural Fit Interview

An interview to assess alignment with Joko's core values and culture.

What to demonstrate

  • An interview to assess alignment with Joko's core values and culture
  • Depth in Technical interviewing

How to prepare

  • Answer aloud and timed: Walk me through the trade-offs between SQL and NoSQL databases for storing user transaction histories.
  • Answer aloud and timed: How do you ensure high availability and data consistency in a distributed system?

Meeting with Founder

Final meeting with one of the founders to ensure alignment with Joko's long-term vision.

What to demonstrate

  • Final meeting with one of the founders to ensure alignment with Joko's long-term vision
  • Depth in Technical interviewing

How to prepare

  • Answer aloud and timed: Walk me through the most technically challenging project you have shipped. What were the bottlenecks, and how did you resolve them?
  • Answer aloud and timed: Tell me about a time you had to refactor a legacy system. What was your strategy, and how did you minimize downtime?

Where candidates lose points

Do your homework on the product

Do not just look at the website. Download the Joko app, understand its core features (cashback, cards, payments), and think about how they work technically. You will definitely be asked what Joko does and how you would improve it.

Be ready to explain the mechanics of cashback and how financial data flows from banks to merchants to users

Showing this domain interest sets you apart immediately.

Prioritize security in your code

Whether in a live coding session or a take-home test, never treat security as an afterthought. Explicitly discuss how you validate inputs, handle sensitive data, and prevent common vulnerabilities.

Questions & practice

Find overlapping job attempts and peak concurrency from lease records

Medium · sweep line · intervals · leases

A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.

Approach

  1. Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
  2. For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
  3. For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
  4. Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.

Follow-up

  • A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
  • Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?

Archive a resource graph without breaking live references or recursing

Medium · graph traversal · topological order · tenant isolation

Resources reference other resources within a tenant; for the largest tenant the reference table holds up to 2,000,000 nodes and 8,000,000 edges. Archiving a resource must archive everything reachable from it that nothing outside the set still references, refuse when a live external referrer exists, and terminate when references form cycles, which they legitimately do. Produce the archive order and the refusal list, targeting O(V+E). Say what stops the traversal crossing a tenant boundary, and why recursion is the wrong control structure at this size.

Approach

  1. Load the subgraph with the tenant predicate on both endpoints of the edge, not only on the side you started from. Scoping the left table alone is the classic cross-tenant leak: one mis-entered edge then pulls another tenant's resources into the traversal and, worse, into the archive.
  2. Traverse iteratively with an explicit stack. A 2,000,000-node graph can hold a chain deep enough to exhaust a native stack in the low tens of thousands of frames, and that failure is a process crash rather than an error you can return.
  3. Treat cycles as data rather than corruption: compute strongly connected components with Tarjan in O(V+E) using its own explicit stack, then condense. The condensation is a DAG, so a topological order over it gives the archive order, and every member of a component archives in one transaction because no order within a cycle is valid.
  4. Decide refusals with reverse edges. A candidate is archivable only if every in-edge originates inside the candidate set, so build the transpose or count in-degrees restricted to the visited set, and emit each blocked resource with the id of the external referrer, which is the only part of the answer an operator can act on.

Follow-up

  • The graph is read in one query and the archive writes a minute later. What can change in between, and how do you make the write safe?
  • The candidate set is 400,000 resources. Is that one transaction, and if not, what does a half-finished archive look like to a reader?

Collapse a redelivered event batch into per-aggregate high-water marks

Easy · hashing · at-least-once · aggregation

You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.

Approach

  1. One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
  2. Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
  3. Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
  4. If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.

Follow-up

  • The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
  • How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?

Why do you want to join Joko specifically, and why now?

Medium · Motivation & Alignment

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?

Walk me through the trade-offs between SQL and NoSQL databases for storing user transaction histories.

Medium · Technical & System Design

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?

Can you explain what Joko does in your own words and how we generate value for our users?

Medium · Motivation & Alignment

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 features of the Joko app do you think could be improved from an engineering perspective?

Medium · Motivation & Alignment

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 stay updated on consumer fintech trends?

Medium · Motivation & Alignment

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 would you design a secure system to track and validate user cashback transactions from third-party partner

Medium · Technical & System Design

How would you design a secure system to track and validate user cashback transactions from third-party partners?

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 security measures would you implement when handling sensitive financial or banking APIs?

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

How do you ensure high availability and data consistency in a distributed system?

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

Walk me through the most technically challenging project you have shipped. What were the bottlenecks, and how

Medium · Past Experience & Background Deep Dive

Walk me through the most technically challenging project you have shipped. What were the bottlenecks, and how did you resolve them?

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?

Describe a situation where a technical decision you made had a direct, measurable impact on business metrics.

Medium · Past Experience & Background Deep Dive

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 technical debt with the pressure to deliver new features quickly?

Medium · Past Experience & Background Deep Dive

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?

Exports duplicate a row range about once a week

Hard · leases · clock skew · idempotency

Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.

Approach

  1. Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
  2. Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
  3. Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
  4. Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.

Follow-up

  • The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
  • You now count takeovers. What alert fires on that counter, and at what threshold?

Suggested practice checklist

Built from the rounds and topics Joko candidates report.

Day 1 — Map the Joko loop

  • Write out the reported sequence: Initial Screening Call, Deep-Dive Technical Phase, Background Checks, Cultural Fit Interview, Meeting with Founder.
  • 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 Technical interviewing

  • Spend the session on Technical interviewing, which Joko candidates report being tested on.
  • Write one worked example in Technical interviewing and time yourself on it.

Deliverable: One timed worked example in Technical interviewing.

Day 3 — Work Coding problem solving

  • Spend the session on Coding problem solving, which Joko candidates report being tested on.
  • Write one worked example in Coding problem solving and time yourself on it.

Deliverable: One timed worked example in Coding problem solving.

Day 4 — Work Take-home assignments

  • Spend the session on Take-home assignments, which Joko candidates report being tested on.
  • Write one worked example in Take-home assignments and time yourself on it.

Deliverable: One timed worked example in Take-home assignments.

Day 5 — Answer out loud: Motivation & Alignment

  • Answer aloud, timed: Why do you want to join Joko specifically, and why now?
  • Answer aloud, timed: Can you explain what Joko does in your own words and how we generate value for our users?

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

Day 6 — Answer out loud: Technical & System Design

  • Answer aloud, timed: How would you design a secure system to track and validate user cashback transactions from third-party partners?
  • Answer aloud, timed: What security measures would you implement when handling sensitive financial or banking APIs?

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

Day 7 — Answer out loud: Past Experience & Background Deep Dive

  • Answer aloud, timed: Walk me through the most technically challenging project you have shipped. What were the bottlenecks, and how did you resolve them?
  • Answer aloud, timed: Tell me about a time you had to refactor a legacy system. What was your strategy, and how did you minimize downtime?

Deliverable: Spoken answers to 2 reported Past Experience & Background Deep Dive 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 refactor a legacy system. What was your strategy, and how did you minimize dow

Medium · Past Experience & Background Deep Dive

Tell me about a time you had to refactor a legacy system. What was your strategy, and how did you minimize downtime?

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 had a strong disagreement with a product manager or another engineer. How did you res

Medium · Behavioral & Cultural Fit

Tell me about a time you had a strong disagreement with a product manager or another engineer. How did you resolve it?

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 project that failed or did not meet expectations. What did you learn, and what would you do differe

Medium · Behavioral & Cultural Fit

Describe a project that failed or did not meet expectations. What did you learn, and what would you do differently?

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 constructive, direct feedback from peers or leadership?

Medium · Behavioral & Cultural Fit

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?

Give an example of a time you had to quickly learn a new technology to solve a critical production issue.

Medium · Behavioral & Cultural Fit

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?