Juspay coding interview
questions, leaked.
11 problems reported across recent Juspay interviews. Top patterns: hash table, array, depth first search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Juspay's coding interview is graph and hash-table heavy. Out of 11 reported problems, 6 involve hash tables and 4 involve graph traversal. You're looking at 5 hard problems and 6 medium ones, no warm-ups. The patterns repeat: DFS/BFS on graphs, hash-table lookups to optimize brute force, and array manipulation under tight constraints. If you hit a wall on the live assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds, so you're never truly stuck.
Top problems at Juspay
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Operations on Tree | MEDIUM | 100.0 | 43% | Array · Hash Table · Tree |
| 02 | Longest Cycle in a Graph | HARD | 100.0 | 50% | Depth-First Search · Breadth-First Search · Graph |
| 03 | Find Closest Node to Given Two Nodes | MEDIUM | 95.8 | 53% | Depth-First Search · Graph |
| 04 | Node With Highest Edge Score | MEDIUM | 90.6 | 48% | Hash Table · Graph |
| 05 | Longest Subsequence With Decreasing Adjacent Difference | MEDIUM | 88.5 | 15% | Array · Dynamic Programming |
| 06 | Set Matrix Zeroes | MEDIUM | 68.8 | 61% | Array · Hash Table · Matrix |
| 07 | Largest Color Value in a Directed Graph | HARD | 62.6 | 58% | Hash Table · Dynamic Programming · Graph |
| 08 | Shortest Path in a Weighted Tree | HARD | 62.6 | 32% | Array · Tree · Depth-First Search |
| 09 | Sliding Window Maximum | HARD | 62.6 | 48% | Array · Queue · Sliding Window |
| 10 | Longest Substring Without Repeating Characters | MEDIUM | 62.6 | 37% | Hash Table · String · Sliding Window |
| 11 | Word Ladder | HARD | 53.9 | 43% | Hash Table · String · Breadth-First Search |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Juspay OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- hash table6 · 55%
- array5 · 45%
- depth first search4 · 36%
- graph4 · 36%
- breadth first search3 · 27%
- tree2 · 18%
- dynamic programming2 · 18%
- topological sort2 · 18%
- sliding window2 · 18%
- string2 · 18%
The problem mix is graph-centric with a hash-table backbone. Hash tables appear in 6 problems, often paired with graphs or arrays to cut down on brute-force scans. Depth-first search and breadth-first search each show up in 4 problems, sometimes in the same problem. Tree operations and topological sort add complexity for hard-tier questions. Array work is persistent, especially in sliding-window and matrix contexts. Dynamic programming appears in 2 problems, usually combined with graph traversal or memoization. Study graph traversal first (DFS/BFS patterns), then hash-table optimizations, then topological sort for the hard problems. StealthCoder is your hedge for any graph variant you haven't drilled: it reads the problem live and outputs a working traversal or topological order instantly.
Companies with similar patterns
If you prepped for Juspay, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Juspay.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Juspay interview FAQ
How many hash-table problems should I solve before the Juspay OA?+
Hash tables show up in 6 out of 11 reported problems. Drill at least 5 to 8 hash-table problems in isolation before the OA, then review 2 to 3 that combine hash tables with graphs or arrays. Focus on collision handling and space optimization, since several problems stack hash tables with other data structures.
Is DFS/BFS enough, or do I need topological sort for Juspay?+
Both. DFS and BFS each appear in 4 problems. Topological sort shows up in 2 hard problems and is often paired with graph traversal or dynamic programming. Get comfortable with standard DFS/BFS first, then practice topological sort on directed acyclic graphs to handle the hard tier.
Should I study dynamic programming before the Juspay interview?+
It's lower frequency (2 problems), but both are hard-tier and paired with graphs or arrays. If you're tight on time, master hash tables and graph traversal first. DP appears in context (longest subsequence, color-value problems), not as standalone DP, so focus on combining it with other patterns.
What's the hardest topic distribution for Juspay?+
Half the problems are hard. The toughest ones involve graph traversal with topological sort or memoization, and sliding-window array problems. No easy problems means every mistake costs. Practice hard problems under time pressure and drill graph edge cases (cycles, disconnected nodes, weighted edges).
Is sliding window important for Juspay?+
It appears in 2 problems, one of which (Sliding Window Maximum) is hard. If you're prepping hash tables and graphs, sliding window is a secondary skill. Study it after nailing graph traversal, but don't skip it. One hard problem on a technique you didn't drill can derail your OA.