Juspay campus candidates from the 2024 and 2025 batches reported an online test with three graph and tree problems (usually the Converging Maze set), a hackathon Part A on the Tree of Space locking problem, a Part B of eight hours or a full day to make that code thread-safe and faster, a technical interview on DSA, OS, DBMS, networks and OOP, and an HR round. One 2025 drive replaced Part B with a Learnathon of Postman API testing and refund test-case design.
Most rejections in these reports came at the online test or the hackathon. The two selected candidates in these reports both went through a full-day hackathon or Learnathon before the final interview.
Juspay interview process round by round
| Round | Duration | What it tests |
|---|---|---|
| Online test | 90-180 min | Three graph and tree problems |
| Hackathon Part A | ~3 hours | Tree of Space on HackerEarth |
| Hackathon Part B | 8 hours to a full day | Thread safety, optimization, explanation |
| Learnathon (some drives) | A full day | Postman API testing, refund test cases |
| Technical interview | ~1 hour | DSA, OS, DBMS, networks, OOP, projects |
| HR round | ~20-30 min | Background, hobbies, fit |
Juspay interview reports from the 2024 and 2025 batches
- SDE, campus, 2025 batch (did not advance past Part B). 90-minute online test on Otomeyt with Maximum Weight Node, Largest Cycle and Meeting Cell; a three-hour Tree of Space round on HackerEarth; an eight-hour optimization and thread-safety round. Reported CTC 27 LPA.
- Product Engineer, campus, 2024 (selected). 180-minute online test with three tree and graph problems; Tree of Space Part A; a full-day Part B on Slack; a technical round on networks, OS, DBMS, DSA and problem-solving.
- SDE and React intern, campus, 2024 batch. Online test with the Converging Maze set on Otomeyt’s Rookie World, role allocation by score, a second role-specific test, a one-day hackathon or Learnathon, and a final interview.
- Campus, Learnathon track, article updated July 2025 (selected). Online test on D2C, Tree of Space on HackerEarth, a second online test, a Learnathon on Slack with a buddy, and a one-hour final.
- SDE (rejected). 90-minute online test with three tree and graph problems, then a Part A problem; not all test cases passed.
- Bengaluru SDE (Glassdoor, 2025-2026). A DSA eligibility round, an aptitude round, hackathon Part A, an elimination round, hackathon Part B and an HR round, held virtually with a possible offline one-to-one.
Detailed interview experiences
Experience 1: SDE, on campus, 2025 batch
Source: GeeksforGeeks, updated May 2024. Did not advance past round 3.
Round 1: Online coding test (Otomeyt, 90 minutes)
- Three graph and tree problems: Maximum Weight Node (easiest), Largest Cycle (medium) and Meeting Cell (hardest). The candidate solved all three.
Round 2: Coding round (HackerEarth, 3 hours)
- Tree of Space. Held the same day as an HR meeting about the hackathon, which the candidate had not expected. All test cases cleared.
Round 3: Optimization and code explanation (8-hour hackathon)
- Reduce the time complexity of the Part A code, make it thread-safe, and explain the approach. A mentor was available, but asking too many questions could hurt the evaluation.
Round 4: Technical interview (not reached)
- Expected to cover OOP, networks, DBMS and DSA.
Result: Stopped after round 3. The candidate reported the CTC for the drive as 27 LPA.
Takeaways
- What decided it: Part B, not the coding test; clearing every Part A test case was not enough.
- How to practice: Write a thread-safe Tree of Space before the drive and practice explaining lock ordering.
Experience 2: Product Engineer, on campus, 2024
Source: GeeksforGeeks, updated July 2024. Selected.
Online coding test (180 minutes)
- Three tree and graph problems; more than half the test cases had to pass.
Hackathon Part A
- Tree of Space, focused on creative problem-solving.
Hackathon Part B
- A full-day hackathon on Slack to build a thread-safe version of the Part A solution.
Technical round
- Computer networks, operating systems, DBMS, DSA and problem-solving.
Takeaways
- What stood out: The same problem carried from Part A to Part B, so clean Part A code made Part B easier.
Experience 3: Learnathon track, on campus (article updated July 2025)
Source: GeeksforGeeks. Selected.
Round 1: Coding test (D2C, 1.5 hours)
- Three medium-hard graph problems. Two solved fully; two or three test cases passed on the third.
Round 2: Tree of Space (HackerEarth, 3 hours)
- Locking and unlocking an N-ary tree. About 59 students advanced.
Round 3: Coding test (D2C, 1.5 hours)
- A binary search problem on an array, the minimum number of characters to remove to turn a string into “Juspay”, and a tree problem. Cleared.
Round 4: Learnathon
- Candidates joined a Slack channel and were paired with a buddy. Part 1 was API testing in Postman with three challenges; the candidate worked from morning until about 10 pm. Part 2 offered a choice of two sections; the candidate chose test-case design for automated refunds.
Round 5: Final (about 1 hour, two interviewers, about 9:00 to 10:15 pm)
- Self-introduction, the Postman test cases from the Learnathon, college projects with a demo, how Gmail works on the backend (where the candidate got stuck), and personal questions about hobbies and travel.
Takeaways
- What stood out: Getting stuck on one design question did not end the candidate’s chances.
- How to practice: Learn Postman collections and tests, and think through refund edge cases such as partial and duplicate refunds.
Experience 4: SDE (rejected)
Source: GeeksforGeeks, updated May 2024.
Online assessment (90 minutes)
- Three DSA problems on trees and graphs. Solutions submitted, but not all test cases passed.
Hackathon Part A
- One demanding DSA problem over several hours. Some test cases unsolved.
Result: Rejected.
Takeaways
- Common fail: Partial solutions on the online test. Practice the Converging Maze problems until they pass every edge case.
Juspay interview questions that come up often
Online test
- Largest Sum Cycle
- Maximum Weight Node
- Nearest Meeting Cell
- Minimum characters to remove to make “Juspay”
- A binary search problem on an array
Hackathon
- Tree of Space: lock, unlock, upgrade
- Make it thread-safe
- Reduce its time complexity and explain
Technical interview
- Graphs, BFS and DFS, binary search
- OS, DBMS, networks, OOP
- Socket programming
- How Gmail works on the backend
HR
- Introduce yourself
- Hobbies and travel
Juspay interview tips from these candidates
- Practice the Converging Maze problems until every edge case passes.
- Keep your Part A code clean; you will extend it for hours in Part B.
- Ask mentors focused questions only.
- Expect late-evening final interviews and long days.
Juspay HR round in these reports
The 2025 final combined technical and personal questions, from the Learnathon test cases to hobbies and travel. Sample answers are on the Juspay HR and behavioral interview questions page, and worked solutions to Tree of Space and the maze problems are on the Juspay interview questions hub.
Juspay interview tips from these reports
Online test
- Three graph and tree problems in 90 to 180 minutes.
- Hidden test cases decide who moves on.
Hackathon
- Tree of Space in Part A on HackerEarth.
- Thread safety and optimization in Part B.
Final interview
- Project demo, CS fundamentals, a backend design question.
- Personal questions about hobbies and travel.
Sources
- GeeksforGeeks: Juspay on-campus interview experience for batch 2025
- GeeksforGeeks: Juspay Product Engineer on-campus 2024
- GeeksforGeeks: Juspay internship on-campus 2024
- GeeksforGeeks: Juspay internship interview experience (Learnathon)
- GeeksforGeeks: JusPay interview experience for SDE
- Bengaluru SDE round order: Glassdoor Juspay interview reviews, 2025-2026