HashedIn LeetCode Questions
23 questions all-time · 3 easy · 15 medium · 5 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 | Find Candidates for Data Scientist Position | Easy | 100 | 76.1% | |
| 2 | Maximize Items | Hard | 100 | 75.2% | |
| 3 | Maximum Points Inside the Square | Medium | 100 | 38.2% | |
| 4 | Count the Number of Powerful Integers | Hard | 83 | 46.5% | |
| 5 | Minimize Length of Array Using Operations | Medium | 83 | 34.9% | |
| 6 | Best Time to Buy and Sell Stock | Easy | 71 | 55.3% | |
| 7 | Trapping Rain Water | Hard | 71 | 65.1% | |
| 8 | Maximum Subarray | Medium | 71 | 52.1% | |
| 9 | 3Sum | Medium | 61 | 37.1% | |
| 10 | Minimum Time to Repair Cars | Medium | 61 | 59.9% | |
| 11 | Container With Most Water | Medium | 61 | 57.8% | |
| 12 | Group Anagrams | Medium | 61 | 70.9% | |
| 13 | Isomorphic Strings | Easy | 61 | 46.9% | |
| 14 | Edit Distance | Medium | 61 | 58.8% | |
| 15 | Maximum Product Subarray | Medium | 61 | 34.9% | |
| 16 | Chalkboard XOR Game | Hard | 61 | 63.0% | |
| 17 | Number of Islands | Medium | 61 | 62.3% | |
| 18 | Beautiful Arrangement | Medium | 61 | 64.5% | |
| 19 | Jump Game | Medium | 61 | 39.5% | |
| 20 | Jump Game II | Medium | 61 | 41.5% | |
| 21 | Next Permutation | Medium | 61 | 43.1% | |
| 22 | Minimum Cost to Make Array Equal | Hard | 61 | 46.3% | |
| 23 | Koko Eating Bananas | Medium | 61 | 49.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.