oyo LeetCode Questions
8 questions all-time · 1 easy · 6 medium · 1 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Koko Eating Bananas Array, Binary Search | Medium | 100 | 0.5% |
| 2 | Furthest Building You Can Reach Array, Greedy, Heap (Priority Queue) | Medium | 100 | 0.5% |
| 3 | Copy List with Random Pointer Hash Table, Linked List | Medium | 88 | 0.6% |
| 4 | House Robber III Dynamic Programming, Tree, Depth-First Search, Binary Tree | Medium | 88 | 0.6% |
| 5 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 88 | 0.6% |
| 6 | 3Sum Array, Two Pointers, Sorting | Medium | 88 | 0.4% |
| 7 | Longest Common Prefix Array, String, Trie | Easy | 88 | 0.5% |
| 8 | Movement of Robots Array, Brainteaser, Sorting, Prefix Sum | Medium | 88 | 0.3% |
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.