Indian

Jio 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
13
Easy
6
Medium
5
Hard
2
Mapped to chapter
7

Array

8 problems

Hard 1

#TitleDifficultyAlso atChapter
3013Divide an Array Into Subarrays With Minimum Cost IIalso at:Amazon Hard

Misc

5 problems

Medium 1

#TitleDifficultyAlso atChapter
3372Maximize the Number of Target Nodes After Connecting Trees IMedium

Hard 1

#TitleDifficultyAlso atChapter
3373Maximize the Number of Target Nodes After Connecting Trees IIHard