Problem database last updated: June 20, 2025
11 problems · 0 Easy, 6 Medium, 5 Hard · Ranked #133 of 458
0 Easy
0% · avg 23%
6 Medium
55% · avg 59%
5 Hard
45% · avg 18%
Based on 11 reported problems, Juspay interviews are significantly harder than average - 45% Hard vs 18% across all companies. The majority (55%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Juspay puts unusual emphasis on topological-sort (18.2% of problems, 15.4x the industry average), graph (36.4% of problems, 12.3x the industry average), depth-first-search (36.4% of problems, 4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are hash-table (54.5%), array (45.5%), depth-first-search (36.4%), graph (36.4%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Longest Cycle in a Graph You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge. | Hard | Very Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Operations on Tree You are given a tree with n nodes numbered from 0 to n - 1 in the form of a parent array parent where parent[i] is the parent of the ith node. The root of the t... | Medium | Very Likely | arrayhash-tabletree | Solve |
Find Closest Node to Given Two Nodes You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge. | Medium | Very Likely | depth-first-searchgraph | Solve |
Node With Highest Edge Score You are given a directed graph with n nodes labeled from 0 to n - 1, where each node has exactly one outgoing edge. | Medium | Very Likely | hash-tablegraph | Solve |
Longest Subsequence With Decreasing Adjacent Difference You are given an array of integers nums. Your task is to find the length of the longest subsequence seq of nums, such that the absolute differences between cons... | Medium | Very Likely | arraydynamic-programming | Solve |
Set Matrix Zeroes Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. | Medium | Likely | arrayhash-tablematrix | Solve |
Shortest Path in a Weighted Tree You are given an integer n and an undirected, weighted tree rooted at node 1 with n nodes numbered from 1 to n. This is represented by a 2D array edges of lengt... | Hard | Likely | arraytreedepth-first-search | Solve |
Sliding Window Maximum You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see... | Hard | Likely | arrayqueuesliding-window | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Likely | hash-tablestringsliding-window | Solve |
Largest Color Value in a Directed Graph There is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1. | Hard | Likely | hash-tablestringdynamic-programming | Solve |
Word Ladder A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: | Hard | Likely | hash-tablestringbreadth-first-search | Solve |
Longest Cycle in a Graph
SolveYou are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.
Operations on Tree
SolveYou are given a tree with n nodes numbered from 0 to n - 1 in the form of a parent array parent where parent[i] is the parent of the ith node. The root of the t...
Find Closest Node to Given Two Nodes
SolveYou are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.
Node With Highest Edge Score
SolveYou are given a directed graph with n nodes labeled from 0 to n - 1, where each node has exactly one outgoing edge.
Longest Subsequence With Decreasing Adjacent Difference
SolveYou are given an array of integers nums. Your task is to find the length of the longest subsequence seq of nums, such that the absolute differences between cons...
Set Matrix Zeroes
SolveGiven an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's.
Shortest Path in a Weighted Tree
SolveYou are given an integer n and an undirected, weighted tree rooted at node 1 with n nodes numbered from 1 to n. This is represented by a 2D array edges of lengt...
Sliding Window Maximum
SolveYou are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Largest Color Value in a Directed Graph
SolveThere is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1.
Word Ladder
SolveA transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Juspay interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Juspay interviews focus heavily on hash-table, array, depth-first-search problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Juspay interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Juspay has been reported to ask 11 distinct coding problems. The most common topics are hash-table, array, depth-first-search. 0 are Easy difficulty, 6 are Medium, and 5 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 11 reported problems, Juspay interviews are significantly harder than average - 45% Hard vs 18% across all companies. 55% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: hash-table, array, depth-first-search. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Juspay coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Juspay interview with AIarrow_forward
