How to crack Juspay: The SDE interview, from real experiences
Juspay SDE interview guide for India campus hiring: the hard 3-question DSA OA, MCQ round, multi-day hackathon, and interview rounds, with real reported questions.
On this page
Last reviewed November 17, 2026.
For students interviewing for SDE, SDE Intern, and 6-month intern-plus-FTE roles at Juspay on Indian campuses.
Built by the Codinzhub team from Juspay online assessment papers and interview experiences that students shared on Codinzhub between January and November 2026, from campuses including IIT Bombay, IIT (BHU) Varanasi, IIIT Allahabad, NSUT, DTU, LNMIIT Jaipur and others. Each report is one person's memory of their own paper or interview. Use this guide as a map, not a promise.
The 30-second version. Juspay's hiring is known for being harder and longer than most campus drives. The process usually opens with an online assessment of 3 DSA questions, often built around trees with path-sum or path-weight queries (segment trees, Euler tours, or similar techniques), graphs with shortest-path updates, or greedy/DP string and array problems. A separate MCQ round (around 16 questions) covers core CS, basic physics and basic maths, sometimes on pen and paper. Candidates who clear this are invited to a multi-stage hackathon, often in Bangalore, which can include a long 8-hour coding session building on your own OA code, with a focus on making code thread-safe without using standard mutex libraries. The final stages are technical interviews that go deep into your resume, system/low-level design, concurrency, networking and the exact DSA algorithm you used in your test. One SDE Intern candidate summarised it as testing "problem-solving, core CS fundamentals, concurrency, system and low-level design, networking, project understanding, and the ability to explain and defend technical decisions," not just DSA.
Important things to know before the interview
Juspay reuses a famous "Tree of Space" locking problem across years. Multiple reports from different years describe the same lock/unlock/upgradeLock problem on an M-ary tree, used in both the OA and the hackathon. If you are preparing for Juspay, study this exact problem; it is reported to recur across hiring cycles.
Reddit independently confirms the same patterns and adds real detail. We searched r/developersIndia and read several live threads. A coding-round helper thread got the comment: "questions are mostly from graphs and trees, leetcode medium and sometimes hard, notorious for repeating questions, so practice PYQs first." A 6-month rejection story says the whole process ran from June to November (about 6 months) and that Hackathon Part B alone was "a crazy 17-hour hackathon" — longer than the 8 hours in our Codinzhub report, so budget a full day for it. Its comments add that after Part B comes a screening round, then the final System interview in Bangalore, which several commenters called the last step. Another thread confirms recruiters also reach out directly over LinkedIn, not only through campus drives.
The OA is "notoriously hard." One 2026 candidate described their OA as "notoriously Hard (Array, DP, Graphs)" and was rejected despite reaching the technical interview. Expect genuinely hard problems, not warm-up questions, and do not be discouraged if you cannot fully solve all three in the time given.
Solving even one question completely can be enough to advance. One SDE Intern report said "solving at least one question successfully can be enough to move to the next stage, depending on the test/evaluation." Partial credit and even a single full solution may matter more than breadth.
The hackathon stage builds directly on your OA code. In one detailed SDE Intern report, Hackathon Part B required making the candidate's own OA solution thread-safe, with the added constraint that standard mutex locks and built-in synchronization primitives were banned — the candidate had to implement synchronization from scratch, assuming only that individual reads and writes were atomic.
Tree path-sum/path-weight queries are a recurring OA theme. Several different-sounding stories (power grid costs, telephone exchange latency, water pipeline maintenance cost, binary tree edge weights) are the same underlying problem: path queries and point updates on a tree, usually solved with Euler tour + Fenwick/segment tree, or heavy-light decomposition for general trees.
What this guide covers
This guide covers the SDE, SDE Intern, and 6-month Intern + PPO (pre-placement offer) roles at Juspay, hired mostly through India campus placement drives in 2026, from colleges including IIT Bombay, IIT (BHU) Varanasi, IIIT Allahabad, IIIT Delhi, NSUT, DTU, LNMIIT Jaipur, MNNIT Allahabad, NIT Patna, IGDTUW and COEP Pune. One report is from an earlier "Juspay Hiring Process Round-2" dated January 2026, which we have kept separate where the process clearly differs.
You will learn the OA pattern, real reported questions for each stage, the hackathon structure, and what interviewers ask.
These are individual experiences, and Juspay's exact format is reported to vary somewhat by year and candidate. Confirm the current format with your placement cell.
Round-by-round breakdown
Stage 1: Application, where candidates applied
How it works. Every Codinzhub report in this guide came from an on-campus placement drive: IIT Bombay, IIT (BHU) Varanasi, IIIT Allahabad, IIIT Delhi, NSUT, DTU, LNMIIT Jaipur, MNNIT Allahabad, NIT Patna, IGDTUW and COEP Pune, across 2026. A Reddit thread we found separately (r/developersIndia) describes a non-campus channel too: a recruiter reaching out directly over LinkedIn for an SDE intern role.
Stage 2: Shortlisting, how candidates moved forward
How it works. Not reported in detail beyond the OA itself acting as the filter. One report noted that shortlisted candidates from the coding round "may be invited to Bangalore" for the hackathon stage, implying an in-person or travel component for some drives.
Stage 3: Online assessment (OA)
How it works. Most reports describe 3 DSA coding questions in one sitting, frequently including a tree with path-query/point-update requirements, a graph with shortest-path queries and edge-weight updates, and a greedy or DP problem on strings or arrays. Some drives add a "Level 2" MCQ block (around 8 questions) after the coding, and others run a separate 16-question MCQ round on core CS, basic physics and basic maths, in some cases on pen and paper.
At a glance
- Duration: 1 hour reported for the 3-question coding level at IIT Bombay; not precisely stated elsewhere
- Questions per round: 3 DSA coding questions, plus 8 to 16 MCQs at several campuses
- Topics: tree path queries (Euler tour, segment/Fenwick tree, HLD), Dijkstra with edge updates, greedy/DP on strings, basic physics and CS fundamentals MCQs
- Qualifying bar: 60% reported for both the coding round and the pen-and-paper MCQ round in one detailed report
Reported questions: tree path-query / point-update problems
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| A tree rooted at R; query the sum of edge weights on the path between two nodes, and update an edge's weight. | Euler tour + Fenwick tree, or HLD | Not reported | OA, Juspay Hiring Challenge 2026 | Range Queries and Point Updates over a weighted rooted Tree |
| Same path-sum/update pattern, framed as "Power Grid Management" between cities on a tree. | Same technique, different story | Not reported | OA, LNMIIT Jaipur and NSUT, 2026 | Power Grid Management, LNMIIT · NSUT |
| Same pattern again, framed as telephone-exchange trunk latency. | Same technique, different story | Not reported | OA, IIT (BHU) Varanasi and COEP Pune, 2026 | Process Route Queries · Trunk Latency Readings |
| Same pattern again, framed as water-pipeline maintenance cost. | Same technique, different story | Not reported | OA, IIT (BHU) Varanasi, 2026 | Water Supply Pipeline Maintenance Cost Queries |
| An infinite binary tree where node i connects to 2i and 2i+1; update and query path-weight sums. | Implicit tree structure, LCA by halving indices | Not reported | OA, IIIT Delhi and IIT Bombay, 2026 | Binary Tree Path Updates and Cost Queries · Smart City Toll System |
Reported questions: graphs
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| Weighted undirected graph; answer shortest-path queries between two nodes, and support edge-weight updates. | Dijkstra, possibly with re-runs on update | Not reported | OA, Juspay Hiring Challenge 2026 and NIT Patna, 2026 | Shortest Path Queries in a Weighted Graph |
| On a rooted tree of safe/hazardous nodes, count leaves reachable without exceeding M consecutive hazardous nodes on the root-to-leaf path. | Tree DFS with a running-streak state | Not reported | OA, 2026 and IIT Bombay, 2026 | Safe Viewpoints · Safe Viewpoints — Kefa and Park-type problem |
| On a tree, find the maximum-weight "good" subset of nodes where no node is an ancestor of another. | Tree DP (independent set on ancestor chains) | Not reported | OA, DTU, 2026 | Juspay OA, DTU |
| On a tree of communication towers (safe/hazardous), find or count valid paths respecting a consecutive-hazard limit. | Tree DFS with state | Not reported | OA, 2026 | Network Technician's Mission |
Reported questions: greedy, DP and string problems
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| Two players remove one charge from a battery per turn, cannot reuse the same battery as the previous turn; determine the winner (Nim-like game theory). | Combinatorial game theory | Not reported | Juspay Hiring Process Round-2, Jan 2026 | Battery |
| Count integers t where gcd(S, M) equals gcd(S+t, M), for 0 ≤ t < M. | Number theory, GCD properties | Not reported | Juspay Hiring Process Round-2, Jan 2026 | Invariant |
| Given a string of D/E characters, repeatedly convert "DE"→"EC" or "ED"→"CE" to gain energy; maximise total energy gained. | Greedy string transformation | Not reported | OA, Hiring Challenge 2026 and NIT Patna, 2026 | Robot Battery Conversion · Magical Sequence Transformation |
| Place merchant stalls in n given intervals to maximise the minimum distance between any two stalls. | Binary search on the answer | Not reported | OA, 2026 | The Medieval Market Problem |
| Minimum moves to rearrange n student positions into n consecutive integers. | Sliding window on sorted positions | Not reported | OA, NSUT, 2026 | Student Rearrangement |
| Given sprinklers with capacity and refill-days, find the minimum days to fully water a garden of capacity C. | Greedy with a priority queue | Not reported | OA, IGDTUW, 2026 | Water the Complete Garden in Minimum Days |
| Given a string s and integer k, build the lexicographically smallest string of length k, using only characters from s, that is strictly greater than s. | Greedy, string construction | Not reported | OA, IIIT Delhi, 2026 | Lexicographically Smallest Greater String |
| Given an array, rewrite it as a permutation of 1..n to maximise the number of unchanged positions. | Greedy / counting | Not reported | OA, 2026 | Maximum Matching Positions with a Permutation |
| Given N intervals, choose one coordinate per interval to maximise the minimum pairwise distance. | Binary search on the answer | Not reported | OA, IIT Bombay, 2026 | Maximize the Minimum Distance Between Points |
| A sync engine must determine which client queries (represented as boolean expression trees with AND/OR/COND nodes) are affected by each write operation. | Expression tree evaluation | Repeated across multiple drives as "Sync Engine" | OA/hackathon, IIIT Allahabad, LNMIIT and IIT (BHU) Varanasi, 2026 | Sync Engine, IIIT Allahabad · Sync Engine, LNMIIT |
Reported questions: MCQs
| Question summary | Skill or pattern | Level / scope | Codinzhub question or experience |
|---|---|---|---|
| Why is there an upper limit on port numbers in networking? | Networking basics | MCQ, MNNIT Allahabad, 2026 | Juspay OA MCQs |
| Best approach for a web server handling many concurrent/I/O-heavy requests: multi-threaded, multi-process, or synchronous? | Concurrency models | MCQ, MNNIT Allahabad, 2026 | Juspay OA MCQs |
Time complexity of a SELECT ... WHERE NAME = X query on an unindexed column. | Database basics | MCQ, MNNIT Allahabad, 2026 | Juspay OA MCQs |
| As the number of compute threads increases on an N-core machine, what generally happens to performance? | Concurrency / systems | MCQ, MNNIT Allahabad, 2026 | Juspay OA MCQs, All 4 Sets |
| Inclined plane with a spring/block system. | Basic physics | MCQ round, reported in interview experience | SDE Intern Full Process Experience |
| Effective frequency heard when a sound source and listener are both moving (Doppler effect). | Basic physics | MCQ round, reported in interview experience | SDE Intern Full Process Experience |
Stage 4: Hackathon / selection event
How it works. Candidates who clear the OA (and sometimes a separate MCQ round) are invited to a hackathon-style event, which one report says can involve travel to Bangalore. Juspay has reportedly reused the same "Tree of Space" lock/unlock/upgradeLock problem across multiple years for this stage, scored out of 300 points with a 60% qualifying bar in one report. Some drives add a further eliminatory DSA round after this part, and a later, more intensive "Part B" session has been reported to run for up to 8 hours over video call and chat, during which the candidate must harden their own earlier code (for example, making it thread-safe without standard mutex primitives) while discussing design decisions live with an interviewer.
At a glance
- Duration: "Hackathon Part A" reported as about 3 hours in one drive; "Part B" reported as an intensive 8-hour session in another
- Questions per round: 1 main hackathon problem (often the Tree of Space lock problem or Sync Engine), plus live design/implementation follow-ups
- Topics: tree/graph algorithms under a strict scoring rubric, concurrency and thread safety, live code review
- Reported examples: Tree of Space locking problem; Sync Engine; making an existing solution thread-safe from scratch
Reported questions
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| Define lock(X, uid), unlock(X, uid) and upgradeLock(X, uid) operations on an M-ary tree representing a world map. | Tree locking with ancestor/descendant checks | Reused across multiple years per candidate reports | Hackathon, 2026 | Locking the tree of space |
| Given client queries as boolean expression trees (AND/OR/COND) over a table, determine which queries are affected by each write. | Expression tree evaluation, incremental updates | Repeated as "Sync Engine" at IIIT Allahabad, LNMIIT and IIT (BHU) Varanasi | Hackathon/OA, 2026 | Sync Engine, LNMIIT · Hackathon Part A, Sync Engine |
| After Hackathon Part A, make your own submitted code thread-safe. Mutex locks and built-in synchronization primitives are banned; implement synchronization from scratch, assuming atomic reads/writes. | Concurrency, synchronization primitives from scratch | Identify race conditions; dry-run the fix; submit by a deadline | SDE Intern, Hackathon Part B, 2026 | SDE Intern Interview Experience |
| Coin Change using DP, discussed as part of the 8-hour hackathon session. | DP | Not reported | SDE Intern, Hackathon Part B, 2026 | SDE Intern Interview Experience |
Stage 5: Technical interview(s)
How it works. The final interview stage is reported to be comprehensive rather than a single DSA check. Interviewers discuss your resume and projects in depth (database schema, scalability, architecture, design decisions), ask about low-level design (LLD) of a real system, cover computer networking concepts, and revisit the DSA algorithm and approach from your OA code, sometimes asking you to dry-run it. One 6-month intern candidate was also given a classic logic puzzle.
At a glance
- Duration: about 40 minutes per round in one detailed report
- Questions per round: a mix of resume/project deep-dive, 1 design discussion, 1 coding/DSA discussion, occasionally a puzzle
- Topics: LLD, project architecture and scalability, networking, your own OA/hackathon code, dry runs
- Reported examples: LLD of a Zomato-like system; dry-running your own submitted code; "find the fastest 3 horses" puzzle
Reported questions
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| Walk through your resume and projects, including database schema, scalability and architecture decisions. | Resume and system depth | Not reported | SDE Intern, in-person interview, 2026 | SDE Intern Interview Experience |
| Low-level design (LLD) of a system like Zomato. | LLD | Not reported | SDE Intern, in-person interview, 2026 | SDE Intern Interview Experience |
| Computer networking concepts, in the context of the LLD discussion. | Networking | Not reported | SDE Intern, in-person interview, 2026 | SDE Intern Interview Experience |
| A shortest-path problem with multiple variables, discussed as a DSA topic in the interview. | Graphs, shortest paths | Not reported | SDE Intern, in-person interview, 2026 | SDE Intern Interview Experience |
| Explain your OA code, the DSA algorithm you used, and dry-run it on test cases. | Code explanation, dry run | How you approached the solution | 6-month Intern + PPO, Round 1, 2026 | 6-month SDE Intern Interview Experience |
| Find the fastest 3 horses (classic comparison-based logic puzzle), plus questions on topics listed on your resume. | Logic puzzle, resume depth | Not reported | 6-month Intern + PPO, Round 2, 2026 | 6-month SDE Intern Interview Experience |
Stage 6: HR round and decision
How it works. One detailed SDE Intern report reached an HR round at the very end of a long process (OA, MCQ, Hackathon Part A and B, in-person interview) and was not selected there, with no further feedback given. Other reports did not reach or did not describe an HR stage. A Reddit thread about a 6-month hiring process (June to November) describes a slightly different final order: Hackathon Part B, then a screening round, then a final System interview in Bangalore that more than one commenter called the last step before a decision; that candidate was rejected at the screening round, before reaching the system interview.
Juspay experiences shared on Codinzhub
| College | Role and result | What was asked | Experience |
|---|---|---|---|
| Not stated | Backend Intern, rejected at HR | 3-DSA OA, 16-Q pen-and-paper MCQ, Hackathon Part A (Tree of Space) and Part B (8-hour thread-safety session), in-person LLD/networking/DSA interview, HR (not selected) | Read it |
| Not stated | SDE, result not reported | 3 hard DSA (graphs, DP, arrays, strings); hackathon/selection event; MCQ round (CS, maths, physics); final round | Read it |
| MNNIT Allahabad | SDE (6-month Intern + FTE), result not reported | Round 1: explain and dry-run your own OA code; Round 2: "fastest 3 horses" puzzle plus resume topics | Read it |
| Not stated | SDE Intern, rejected in Round 2 | Hard 3-question OA (array, DP, graphs); very tough technical interview | Read it |
The Codinzhub next-round playbook
To prepare for the OA
- Master Euler tour + Fenwick/segment tree (or heavy-light decomposition) for "sum of edge weights on a tree path, with point updates" — this exact pattern repeated under at least 5 different story wrappers across campuses.
- Practise Dijkstra's algorithm with repeated queries and edge-weight updates between queries.
- Study the "Tree of Space" lock/unlock/upgrade-lock problem specifically; it has been reused across multiple hiring cycles.
- Practise evaluating boolean expression trees (AND/OR/COND nodes) efficiently against incremental writes — the recurring "Sync Engine" question.
- Expect genuinely hard problems; solving even one completely can be enough to advance, so prioritise getting a full, correct solution on your strongest question over partial attempts on all three.
- If an MCQ round is on pen and paper, revise basic physics (inclined planes, springs, Doppler effect) alongside core CS and database fundamentals.
To prepare for the hackathon
- Practise identifying race conditions in your own code and reasoning about synchronization without relying on a language's built-in mutex, in case you are asked to build synchronization from scratch.
- Be ready to defend and explain code you wrote hours or days earlier; interviewers in later stages build directly on your own hackathon submission.
- Keep clean, readable code during the hackathon itself, since later interview rounds revisit and dry-run it with you.
To prepare for the technical interview
- Prepare a complete, deep walkthrough of your most complex project: schema, scalability choices, and the reasoning behind each design decision.
- Practise a basic LLD walkthrough of a well-known consumer app (food delivery, ride-hailing), including class design and how components interact.
- Revisit networking fundamentals (ports, protocols, concurrency models for servers), since these connect directly to the LLD discussion.
- Review your own OA submission before the interview so you can dry-run it confidently and explain exactly which algorithm and complexity you used.
Variations within this role
| Variation | What was reported |
|---|---|
| Role name | Reports describe SDE, SDE Intern, Backend Intern and "6-month Intern + PPO" roles; the OA and hackathon patterns look the same across these, though the exact number of interview rounds varies. |
| Hackathon location | At least one report mentions candidates being "invited to Bangalore" for the hackathon stage, suggesting some drives include travel. |
| Process length | The most detailed report (Backend Intern) went through 5 distinct stages (OA, MCQ, Hackathon A, Hackathon B, interview) before an HR rejection; a shorter 2-round process was reported for a different 6-month intern + FTE drive. |
| Older process (January 2026) | The "Juspay Hiring Process Round-2" report (Battery, Invariant questions) is a math/game-theory-heavy OA, different in character from the tree/graph-heavy 2026 campus OAs; treat it as a separate data point. |
Do's and don'ts
| Do | Don't | Why it matters |
|---|---|---|
| Master Euler tour + Fenwick tree for tree path-sum queries. | Treat each "power grid" / "pipeline" / "latency" story as a new problem. | These are the same underlying technique reported at 5+ different campuses. |
| Aim to fully solve your strongest OA question. | Spread effort thinly trying to attempt all 3 equally. | One report says solving even one question completely can be enough to advance. |
| Practise explaining your own code's time/space complexity after the fact. | Submit code you cannot explain later. | Interview rounds build directly on your OA and hackathon submissions and ask you to dry-run them. |
| Prepare to reason about concurrency without built-in mutexes. | Assume thread-safety questions only need "just use a mutex". | One hackathon stage explicitly banned standard synchronization primitives. |
| Know your project's database schema and scalability trade-offs cold. | Describe a project only at a feature level. | Interviewers go deep into schema and architecture, not just what the project does. |
Most-asked topics
Frequency below is based on 4 Codinzhub interview experiences and about 30 Codinzhub OA question records for this role. We do not give percentages.
| Topic | What it means | Evidence-backed priority | Reported examples | Codinzhub practice |
|---|---|---|---|---|
| Tree path queries with updates | Sum/weight queries along a tree path, with point updates | High (recurring across 6+ reports under different names) | Power Grid Management, Trunk Latency, Binary Tree Path Updates | Range Queries and Point Updates over a weighted rooted Tree |
| Graphs and shortest paths | Dijkstra-style queries, sometimes with edge updates | High in the OA | Shortest Path Queries in a Weighted Graph | Shortest Path Queries in a Weighted Graph |
| Concurrency and thread safety | Making code correct when multiple threads run it at once | High in the hackathon and interview | Thread-safety hardening without mutexes | SDE Intern Interview Experience |
| Greedy and binary search on the answer | Choosing optimal values under a monotonic constraint | Medium-high in the OA | Medieval Market stalls, garden watering, maximize minimum distance | The Medieval Market Problem |
| Low-level design (LLD) | Designing classes and their interactions for a real system | Medium-high in interviews | LLD of a Zomato-like system | SDE Intern Interview Experience |
| Expression tree evaluation | Evaluating nested AND/OR/condition trees against changing data | Medium (recurring "Sync Engine" question) | Sync Engine | Sync Engine, LNMIIT |
| Networking and systems basics | Ports, protocols, concurrency models for servers | Medium in MCQs and interviews | Port number limits, multi-threaded vs multi-process servers | Juspay OA MCQs |
The question patterns that keep coming back
Tree path-sum query with point update, under many story wrappers
How it appears. A tree (power grid, telephone network, water pipelines, or an implicit binary tree by index) where you must answer "sum of weights on the path between two nodes" and "update one edge's weight," repeated many times. This is the single most repeated OA pattern across campuses.
What to recognise. Build an Euler tour of the tree, then use a Fenwick tree or segment tree over the tour to support range-sum and point-update queries, or use heavy-light decomposition for a more general version. For the implicit binary tree (node i connects to 2i and 2i+1), find the path by repeatedly halving the deeper index until the two meet.
Practise. Range Queries and Point Updates over a weighted rooted Tree, then Binary Tree Path Updates and Cost Queries.
The "Tree of Space" locking problem
How it appears. Define lock, unlock and upgradeLock operations on a tree, where locking or unlocking a node must respect its ancestors' and descendants' lock states. Reported as reused across multiple Juspay hiring cycles.
What to recognise. This needs efficient ancestor/descendant checks (often via DFS numbering or binary lifting) so each operation runs faster than a naive full-subtree scan.
Practise. Locking the tree of space.
Sync Engine: evaluating boolean expression trees against writes
How it appears. Each client subscribes to a query represented as an AND/OR/COND expression tree; after each write (INSERT/UPDATE/DELETE), determine which queries could now match differently.
What to recognise. For a simple version, re-evaluate each query's tree against the changed row directly. For the harder version (many queries, many writes), index conditions by column so you only re-check queries that reference a changed column.
Practise. Sync Engine, LNMIIT, then Sync Engine, IIT (BHU) Varanasi.
Consecutive-hazard-limited root-to-leaf paths on a tree
How it appears. Each tree node is safe or hazardous; count leaves reachable from the root without exceeding M consecutive hazardous nodes anywhere on the path.
What to recognise. A single DFS carrying the "current consecutive hazardous streak" as state, resetting the streak at every safe node, solves this directly.
Practise. Safe Viewpoints, then Safe Viewpoints — Kefa and Park-type problem.
Preparing for the behavioural and project-depth questions
Juspay's interviews lean heavily on your own project and code rather than generic behavioural questions. Prepare to explain, in detail, the database schema, scalability decisions, and specific trade-offs behind your most substantial project, since one candidate reported the interviewer reviewing "database schema, scalability, architecture, and the design decisions" directly. Also prepare to discuss and defend the exact algorithm you used in your own OA or hackathon submission, including a dry run on a sample input, since more than one report describes this as a direct interview task.
Practice problems that match the experiences
These are practice analogues: similar problems for practice, not proof that Juspay asked the exact LeetCode problem, unless the row says the same name was reported.
| # | Practice problem | Pattern | Related reported question or variant |
|---|---|---|---|
| 1 | Tree (Path Queries) — Fenwick/Euler Tour practice (GeeksforGeeks) | Euler tour + Fenwick tree | Power Grid Management, Trunk Latency, Process Route Queries |
| 2 | Network Delay Time (LeetCode) | Dijkstra's algorithm | Shortest Path Queries in a Weighted Graph |
| 3 | Maximum Width Ramp / Binary Search on Answer practice (LeetCode: Magnetic Force Between Two Balls) | Binary search on the answer | Maximize the Minimum Distance Between Points, Medieval Market |
| 4 | Coin Change (LeetCode) | DP | Coin Change DP, Hackathon Part B |
| 5 | Minimum Number of Operations to Make Array Continuous (LeetCode) | Sliding window on sorted array | Student Rearrangement |
| 6 | Binary Tree Maximum Path Sum (LeetCode: analogous ancestor-chain DP) | Tree DP | "Good subset" with no ancestor-descendant pair |
| 7 | Design Compressed String Iterator / expression evaluators (GeeksforGeeks: Expression Tree) | Expression tree evaluation | Sync Engine |
How to handle a question you have never seen
- Read every constraint carefully; Juspay's questions often disguise a standard technique (Euler tour, Dijkstra, binary search on the answer) inside an unfamiliar story.
- Ask yourself: is this really "path sum on a tree with updates"? That exact shape has repeated many times.
- Write the brute-force version first to confirm correctness on the sample, then identify what makes it too slow (usually repeated path traversal or repeated full recomputation).
- For tree problems, consider Euler tour + Fenwick/segment tree, or heavy-light decomposition if the tree is not a simple chain or binary structure.
- For "maximize the minimum" or "minimize the maximum" phrasing, consider binary search on the answer with a feasibility check.
- If you are short on time, aim to fully and correctly solve your strongest question rather than leaving all three partially done.
Why candidates were rejected
Only two reports in this guide give a clear outcome, and neither includes official feedback:
- Backend Intern: reached the HR round after passing OA, MCQ, both hackathon parts, and the in-person interview, then was told "not selected" with no further detail given.
- SDE Intern: rejected in Round 2 after a "very tough technical interview," following a 3-question OA the candidate called "notoriously hard."
Treat the following as editorial advice, not confirmed rejection reasons:
- Submitting a partially correct attempt at all 3 OA questions instead of one fully correct, well-tested solution.
- Being unable to explain or dry-run your own earlier code when asked to revisit it in a later stage.
If you remember only five things
- Juspay's process is long and hard: expect an OA, MCQs, a multi-stage hackathon, and interviews, not a single round.
- Master Euler tour + Fenwick/segment tree for "tree path sum with point updates"; it is the single most repeated OA pattern here.
- Study the "Tree of Space" locking problem specifically; it has been reused across multiple hiring years.
- Be ready to defend and dry-run your own OA/hackathon code in later interview rounds.
- Prepare concurrency and thread-safety reasoning that does not depend on a language's built-in mutex.
FAQ
Is Juspay's OA harder than most campus drives?
Based on these reports, yes. Candidates described it as "notoriously hard," and at least one process allowed advancing with only one fully solved question out of three.
Does Juspay always run a hackathon after the OA?
Most detailed reports describe a hackathon/selection stage after the OA, sometimes involving travel to Bangalore, but the exact structure (one part vs. two parts, 3 hours vs. 8 hours) varies by report.
What is the "Tree of Space" problem?
A tree-locking problem (lock, unlock, upgradeLock operations on nodes of an M-ary tree) that multiple candidate reports describe as reused across different hiring years, in both the OA and the hackathon.
Do I need system design experience for an intern role?
Reports suggest yes: even intern-level interviews included low-level design discussion (such as designing a Zomato-like system) and deep questions about project architecture and scalability.
Can I use standard mutex libraries if asked to make code thread-safe?
Not always. One hackathon stage explicitly banned standard mutex locks and built-in synchronization primitives, requiring synchronization to be implemented from scratch.
About this guide
The Codinzhub team wrote this guide from 4 Juspay interview experiences and about 30 OA question records shared on Codinzhub between January and November 2026, from campus drives at IIT Bombay, IIT (BHU) Varanasi, IIIT Allahabad, IIIT Delhi, NSUT, DTU, LNMIIT Jaipur, MNNIT Allahabad, NIT Patna, IGDTUW and COEP Pune. Questions are short paraphrases in our own words. Practice problems are similar problems we picked for each pattern, not exact matches unless marked.
You can help other students by sharing your Juspay experience on Codinzhub.
Interview processes change by campus, year and batch. Your placement cell or recruiter can confirm the current format.
Other company and role guides
Keep track of what you’ve learned.