Indian

Juspay interview questions

Grouped by topic, sorted Easy → Medium → Hard, then by LeetCode ID. Click a problem to open it on LeetCode; the chapter column links to the handbook chapter that covers it.

Problems
17
Easy
2
Medium
11
Hard
4
Mapped to chapter
7

Array

11 problems

Hash Table

3 problems

Hard 1

#TitleDifficultyAlso atChapter
1857Largest Color Value in a Directed GraphHard

Misc

3 problems

Medium 2

#TitleDifficultyAlso atChapter
1717Maximum Score From Removing Substringsalso at:Swiggy Medium
2359Find Closest Node to Given Two Nodesalso at:Amazon Medium

Hard 1

#TitleDifficultyAlso atChapter
2360Longest Cycle in a Graphalso at:PhonePe HardChapter