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 problemsEasy 3
Medium 4
Hard 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 3013 | Divide an Array Into Subarrays With Minimum Cost IIalso at:Amazon | Hard | — |
Misc
5 problemsEasy 3
Medium 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | Medium | — |
Hard 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | Hard | — |
No problems match those filters
Toggle a difficulty back on or clear the search.