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 problemsEasy 2
Medium 7
Hash Table
3 problemsMedium 2
Hard 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 1857 | Largest Color Value in a Directed Graph | Hard | — |
Misc
3 problemsMedium 2
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 1717 | Maximum Score From Removing Substringsalso at:Swiggy | Medium | — | |
| 2359 | Find Closest Node to Given Two Nodesalso at:Amazon | Medium | — |
Hard 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 2360 | Longest Cycle in a Graphalso at:PhonePe | Hard | Chapter |
No problems match those filters
Toggle a difficulty back on or clear the search.