jio LeetCode Questions
7 questions all-time · 2 easy · 3 medium · 2 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Divide an Array Into Subarrays With Minimum Cost II Array, Hash Table, Sliding Window, Heap (Priority Queue) | Hard | 100 | 0.5% |
| 2 | Find the Grid of Region Average Array, Matrix | Medium | 100 | 0.4% |
| 3 | Maximize the Number of Target Nodes After Connecting Trees I Tree, Depth-First Search, Breadth-First Search | Medium | 100 | 0.7% |
| 4 | Maximize the Number of Target Nodes After Connecting Trees II Tree, Depth-First Search, Breadth-First Search | Hard | 100 | 0.7% |
| 5 | Two Sum Array, Hash Table | Easy | 63 | 0.6% |
| 6 | Reverse Linked List Linked List, Recursion | Easy | 63 | 0.8% |
| 7 | Group Anagrams Array, Hash Table, String, Sorting | 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.