7 curated coding interview questions directly asked in Jio technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 100.0% | all |
| 3030 | Find the Grid of Region Average | Medium | Core DSA | Implementation / Reasoning | 43.5% | 100.0% | all |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | Medium | Trees | DFS / BFS | 69.4% | 100.0% | all |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | Hard | Trees | DFS / BFS | 73.1% | 100.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 62.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | all |