Juspay interview process (2026)

Round-by-round breakdown of the Juspay software engineering interview across 2 levels and 14 rounds: interview mode, sample questions, and worked solutions.

Juspay salary & ratings · All interview processes

Software Engineer / FP-Engineer (new grad, intern-to-PPO, on/off-campus)

Difficulty: Hard · Timeline: ~2-4 weeks · Recommended prep: 2-3 months · Cooldown: 6-12 months

  1. Round 0: Online Coding Test (HackerEarth)

    Assessment · ~90 min · difficulty 3/5 · elimination round

    Mode of interview: Online assessment

    Sample question: Node With Highest Edge Score — You are given a directed graph with n nodes where each node has exactly one outgoing edge, given as an array edges (edges[i] is the node i points to). The edge score of a node is the sum of the indices of all nodes that point to it. Return the node with the highest edge score; on a tie return the smallest index. (Juspay campus OA names this 'Maximum Weight Node'.)

  2. Round 1: Online MCQ Assessment

    Assessment · ~60 min · difficulty 2/5 · elimination round

    Mode of interview: Online assessment

  3. Round 2: Hackathon Part A ('Tree of Space' design + implement)

    Assessment · ~3 hours · difficulty 4/5 · elimination round

    Mode of interview: Online assessment

  4. Round 3: Elimination DSA Interview

    Phone · ~30-60 min · difficulty 4/5 · elimination round

    Mode of interview: Remote phone or video interview

    Sample question: Longest Cycle in a Graph — You are given a directed graph of n nodes where each node has at most one outgoing edge, given as edges (edges[i] is the node i points to, or -1 if none). Return the length of the longest cycle, or -1 if there is no cycle. (Juspay campus OA names this 'Largest Cycle'.)

  5. Round 4: Hackathon Part B (optimization + concurrency)

    System_design · ~8-9 hours · difficulty 4/5

    Mode of interview: Live system design interview

    Sample question: Tree of Space - Locking / Unlocking / Upgrade on an N-ary Tree (LLD) — Design a data structure over a generic M-ary tree of N named nodes supporting three operations, each in better than O(N): lock(node, uid) grants a user exclusive control of a subtree - it fails if node is already locked, if any ancestor is locked, or if any descendant is locked; unlock(node, uid) releases a lock only if held by the same uid; upgrade(node, uid) locks node and auto-unlocks all its descendant locks, but only if node has >=1 locked descendant and ALL locked descendants are held by uid. Specify the node model and parent/ancestor bookkeeping, then extend the design to be thread-safe on a multi-core machine (concurrent locks/unlocks) without a global lock.

  6. Round 5: Technical Interview (projects + DSA + CS core)

    Onsite · ~1-2 hours · difficulty 3/5

    Mode of interview: Onsite or virtual onsite interview

    Sample question: Largest Color Value in a Directed Graph — You are given a directed graph of n nodes with a color assigned to each node (lowercase letter string colors) and a list of directed edges. For any valid path, its 'color value' is the number of nodes that are the most frequently occurring color along that path. Return the largest color value over all paths, or -1 if the graph contains a cycle.

  7. Round 6: Final Onsite / System & Cultural Round (Bangalore)

    Onsite · ~2-day · difficulty 3/5

    Mode of interview: Onsite or virtual onsite interview

  8. Round 7: Offer / HR

    Offer · Short

    Mode of interview: Offer discussion

Software Engineer / SDE-1 (experienced / lateral, via HackerEarth)

Difficulty: Hard · Timeline: ~1-2 weeks · Recommended prep: 1-2 months · Cooldown: Not documented.

  1. Round 0: Online Coding Test (HackerEarth)

    Assessment · Timed online test · difficulty 3/5 · elimination round

    Mode of interview: Online assessment

    Sample question: LRU Cache — Design and implement a Least Recently Used (LRU) cache supporting get(key) and put(key, value) in O(1) average time. get returns the value or -1 if absent and marks the key most-recently-used; put inserts/updates and, if capacity is exceeded, evicts the least-recently-used key.

  2. Round 1: Remote Hackathon Round A

    System_design · ~2 hours · difficulty 4/5

    Mode of interview: Live system design interview

    Sample question: Design an idempotent payment gateway / transaction service — Design the core of a payment gateway that talks to unreliable downstream PSPs/banks. Cover the transaction state machine (INITIATED -> PENDING -> SUCCESS/FAILED), an API/DB schema, and how you prevent double-charges over a flaky network using idempotency keys and a retry mechanism. Discuss where idempotency is enforced (client key + dedup store), exactly-once vs at-least-once semantics, and how TLS/SSL certificate validation (certificate-authority trust chain) secures the calls.

  3. Round 2: Remote Hackathon Round B (concurrency/scalability)

    System_design · Extended session · difficulty 4/5

    Mode of interview: Live system design interview

    Sample question: Design a thread-safe, scalable in-memory service (rate limiter / KV store) — Starting from an under-specified problem, extract requirements and do the low-level design of one module of a concurrent in-memory system - e.g. a rate limiter (token/leaky bucket) or a thread-safe key-value store. Then extend it to support concurrency and horizontal scalability: define the locking/synchronization strategy (avoiding a single global lock), how you keep operations correct under many threads, and how state is partitioned/replicated as you scale out. This mirrors the HackerEarth hackathon Part-B 'make it support concurrency and scalability' follow-up.

  4. Round 3: Technical Interview (2-on-1)

    Onsite · ~2 hours · difficulty 3/5

    Mode of interview: Onsite or virtual onsite interview

    Sample question: Sliding Window Maximum — Given an integer array of length n and a window size k, return an array of the maximum value in every contiguous window of size k as the window slides left to right. Aim for O(n) time using a monotonic deque.

  5. Round 4: Founder / CEO Interview

    Behavioral · Day-long, mentorship-toned · difficulty 3/5

    Mode of interview: Live behavioral interview

  6. Round 5: HR Round / Offer

    Offer · Short

    Mode of interview: Offer discussion

Other companies' interview processes

Worked sample solutions (code, design diagrams, and STAR answers) for every round are available in the FAANGPlus app: open interview processes.