VMware LeetCode Questions
9 questions all-time · 0 easy · 7 medium · 2 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Break a Palindrome String, Greedy | Medium | 100 | 0.5% |
| 2 | Find Palindrome With Fixed Length Array, Math | Medium | 100 | 0.4% |
| 3 | Make Array Non-decreasing or Non-increasing Array, Dynamic Programming, Greedy, Heap (Priority Queue) | Hard | 100 | 0.7% |
| 4 | Koko Eating Bananas Array, Binary Search | Medium | 64 | 0.5% |
| 5 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 64 | 0.6% |
| 6 | Linked List Cycle II Hash Table, Linked List, Two Pointers | Medium | 64 | 0.6% |
| 7 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 64 | 0.5% |
| 8 | Time Based Key-Value Store Hash Table, String, Binary Search, Design | Medium | 64 | 0.5% |
| 9 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 64 | 0.5% |
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.