Mindtickle LeetCode Questions
4 questions all-time · 0 easy · 1 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Find Array Given Subset Sums Array, Divide and Conquer | Hard | 100 | 48.7% |
| 2 | Get the Maximum Score Array, Two Pointers, Dynamic Programming, Greedy | Hard | 100 | 40.0% |
| 3 | Number of Ways to Wear Different Hats to Each Other Array, Dynamic Programming, Bit Manipulation, Bitmask | Hard | 100 | 44.4% |
| 4 | Capacity To Ship Packages Within D Days Array, Binary Search | Medium | 65 | 72.1% |
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.