Autocoder

Juspay Interview Questions with Answers

Last updated 2026-11-19

Juspay builds payment infrastructure, and it is known among Indian engineers for a strong computer science bar and for using functional programming (Haskell, among other tools) in its stack. Interview practice should therefore lean on fundamentals: operating systems, concurrency, databases, graphs and clean reasoning about money-moving systems.

These twelve questions with worked answers are practice in the style of those topics, not a record of any test. For the problem-solving side see Juspay coding round questions, and for the hiring process read how to crack the Juspay interview.

Hiring challenge (reported)MCQ rounds, then three coding problems in about 90 minutes, then interviews
Topics reportedDSA, graphs, concurrency, OS, DBMS
Role reportedSDE intern (6-month) with FTE conversion

Rounds as commonly reported

The sourced description is a hiring challenge with MCQ rounds (reported as 30 MCQs in 30 minutes, then MCQs on systems, algorithms and reasoning), followed by a coding round of three problems in about 90 minutes and then final technical interviews, with HR if you clear them. The 2025 edition was reported on the Unstop platform for the 2026 B.Tech batch. It is an external description, so confirm the current format with Juspay.

What a payments company probes

Correctness under failure is the theme. A debit may succeed while the response is lost; two requests may race for the same balance. If you can talk about idempotency, atomic updates and reconciliation, you show you understand why payment engineers care about the details.

Hiring status

The only company-specific facts we hold for Juspay are the process details above, described in the sources listed below: a hiring challenge with MCQ rounds, three coding problems in about 90 minutes and final interviews, run on Unstop for the 2025 edition with eligibility of B.Tech or B.E. batch 2026, any branch, solo. These come from third-party write-ups, not a Juspay announcement, and we have no sourced dates or openings for 2026-27. Juspay has no page in our hiring section; check juspay.io/careers for what is open now.

Juspay Interview Questions with Answers: questions with worked answers

  1. 1

    Walk me through what happens when a user pays by UPI in an app.

    easy

    The app creates an order on the merchant server, which asks a payment aggregator or gateway for a payment session. The user picks a UPI app or enters a VPA; a collect or intent request goes through the payment service provider to NPCI, which routes it to the payer's bank for approval with the UPI PIN. The bank debits the payer, the credit reaches the payee bank, and callbacks (webhooks) tell the merchant the final status. Because callbacks can be delayed or duplicated, the merchant must verify status with the gateway and keep order updates idempotent.

  2. 2

    How do you make a payment API idempotent?

    medium

    The client sends a unique idempotency key with each logical request. The server stores the key with the request fingerprint and the response under a unique constraint, inside the same transaction as the side effect. A repeat with the same key returns the saved response; the same key with a different body is rejected. Keys expire after a window. This turns "at least once" delivery into "effectively once" processing and makes client retries on timeouts safe.

  3. 3

    Two threads deduct from the same wallet balance. What can go wrong and how do you fix it?

    medium

    A read-modify-write sequence is a race: both read 100, both write 70 and 60, and one deduction is lost. Fix it with an atomic conditional update at the database, with a row lock inside a transaction, or in-process with a mutex or compare-and-swap. The check for sufficient balance must be part of the same atomic step. Also guard against deadlocks by locking accounts in a consistent order when transferring between two wallets.

    sql
    UPDATE wallets
    SET balance = balance - 300
    WHERE id = 7 AND balance >= 300;
    -- rows affected = 0 means insufficient funds
  4. 4

    Explain mutex, semaphore and condition variable, and when you would use each.

    medium

    A mutex gives one thread exclusive ownership of a critical section, released by the same thread. A semaphore holds a count: a binary semaphore resembles a mutex but has no owner, and a counting semaphore limits concurrent users of a pool, such as five database connections. A condition variable lets threads wait until a predicate becomes true and be woken by another thread, always used with a mutex and checked in a loop to guard against spurious wakeups. Producer-consumer queues use a mutex plus two condition variables, or semaphores for empty and full slots.

  5. 5

    What is a deadlock and what are the Coffman conditions?

    medium

    A deadlock is a state where threads each hold a resource and wait for another held by someone else, so none can proceed. It needs mutual exclusion, hold and wait, no preemption and circular wait together. Prevent it by removing one: impose a global lock order, acquire all locks at once, or use timeouts with try-lock and back-off. Detection builds a wait-for graph and looks for a cycle, which databases do before aborting a victim transaction.

  6. 6

    What is the difference between a process and a thread, and what does a context switch cost?

    medium

    A process has its own address space, file descriptors and resources; threads inside it share the heap and code but have separate stacks and registers. Switching threads of one process is cheaper than switching processes because the address space and, on many CPUs, the TLB contents stay valid. The cost comes from saving and restoring registers, scheduler work and cache effects. Too many threads for a CPU-bound workload wastes time on switching.

  7. 7

    Why does Juspay-style engineering favour immutability and pure functions?

    medium

    Pure functions return the same output for the same input and have no side effects, so they are easy to test and safe to run concurrently. Immutable data cannot be changed behind your back, which removes a whole class of shared-state bugs. Strong static types, as in Haskell, push many errors to compile time, valuable when a bug moves money. The trade-off is a learning curve and sometimes extra copying, which persistent data structures reduce. Say what you have tried: a small project with map, filter and reduce is enough.

    python
    # pure: no mutation, same input gives the same output
    def apply_fee(amounts, rate):
        return [round(a * (1 + rate), 2) for a in amounts]
    
    # impure: mutates its argument, the callers list changes
    def apply_fee_bad(amounts, rate):
        for i in range(len(amounts)):
            amounts[i] *= (1 + rate)
  8. 8

    Explain ACID, and what happens to a transfer if the server crashes after the debit but before the credit.

    medium

    Atomicity means both the debit and credit happen or neither; consistency keeps constraints valid; isolation hides concurrent transactions from each other; durability means committed data survives a crash. If both updates are in one transaction, a crash before commit rolls back the debit on recovery using the write-ahead log. Across two services there is no single transaction, so use a saga with compensating actions or an outbox with reconciliation, and make each step idempotent.

  9. 9

    How would you reconcile payments between your records and a bank statement?

    hard

    Match on a stable reference (the bank reference number or your transaction id), and compare amount and status. Produce three sets: matched, in your records only, and in the statement only. Mismatches are investigated: a pending that later succeeded, a duplicate, or an amount difference from fees. Run it daily as a batch with an anti-join, keep results immutable and auditable, and alert on counts above a threshold. Money amounts should be stored as integers in the smallest unit (paise), never as floats.

    sql
    SELECT t.txn_id, t.amount, 'missing_in_bank' AS issue
    FROM txns t
    LEFT JOIN bank_stmt b ON b.ref = t.bank_ref
    WHERE b.ref IS NULL
    UNION ALL
    SELECT b.ref, b.amount, 'missing_in_ours'
    FROM bank_stmt b
    LEFT JOIN txns t ON t.bank_ref = b.ref
    WHERE t.bank_ref IS NULL;
  10. 10

    Design a retry policy for calls to a flaky bank API.

    hard

    Retry only operations that are safe: reads, or writes protected by an idempotency key. Use exponential back-off with jitter (for example base 200 ms, doubling to a cap, randomised) so clients do not retry in lockstep, set a maximum attempts count and an overall deadline, and treat 4xx validation errors as non-retryable. Add a circuit breaker that stops calling a failing dependency for a cool-down, and fall back to another route if one exists. Log each attempt with the same correlation id.

  11. 11

    Why do you want to join Juspay, and what do you know about the company?

    medium

    Say something verifiable: it builds payment infrastructure used by many apps, and you are drawn to problems where reliability and correctness matter. Link it to your own interests, for example concurrency or functional programming, and to something you have built. Avoid quoting figures you cannot source. End by saying what you hope to learn in the first six months.

  12. 12

    Tell me about a bug that took you a long time to find.

    medium

    Pick a real example. Describe the symptom, how you narrowed it (reproducing, logging, bisecting), the root cause and the fix, then the safeguard you added, such as a test or an assertion. Interviewers listen for method rather than luck, and for what you would do differently, such as writing the failing test earlier.

Frequently asked questions

What is the Juspay hiring challenge format?

Third-party write-ups describe MCQ rounds followed by three coding problems in about 90 minutes, then interviews. The 2025 edition was reported on Unstop for the 2026 batch. Confirm the current format on Juspay's own channels.

Do I need to know Haskell?

Not for most reports of the process, which test general CS and DSA. Familiarity with functional ideas such as immutability and higher-order functions helps in discussion.

Which subjects matter most?

Reports mention DSA, graphs, concurrency, operating systems and DBMS. Prepare operating-system MCQs as well as coding.

Are the questions here from a real Juspay test?

No. They are practice questions in the style of the topics reported, not copies of any paper.

Where do I check current openings?

Use juspay.io/careers. We hold no sourced dates or openings beyond the process description on this page.

Sources

Related guides

More in Company Interview Questions

See all in this section