jio LeetCode Questions
7 questions all-time · 2 easy · 3 medium · 2 hard
Track your progress. Sign in free to tick off problems and save what you've solved across every company.
| # | Problem | Difficulty | Frequency | Acceptance | |
|---|---|---|---|---|---|
| 1 | Divide an Array Into Subarrays With Minimum Cost II | Hard | 100 | 0.5% | |
| 2 | Find the Grid of Region Average | Medium | 100 | 0.4% | |
| 3 | Maximize the Number of Target Nodes After Connecting Trees I | Medium | 100 | 0.7% | |
| 4 | Maximize the Number of Target Nodes After Connecting Trees II | Hard | 100 | 0.7% | |
| 5 | Two Sum | Easy | 63 | 0.6% | |
| 6 | Reverse Linked List | Easy | 63 | 0.8% | |
| 7 | Group Anagrams | Medium | 63 | 0.7% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.