VMware coding interview
questions, leaked.
20 problems reported across recent VMware interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
VMware's coding assessments hit you with 20 problems, mostly medium difficulty, and they lean hard on arrays and hash tables. You'll see 8 array problems alone, plus 6 hash-table questions mixed into various patterns. The good news: if you've drilled Two Sum, Best Time to Buy and Sell Stock, and LRU Cache, you're covering a lot of ground. The bad news: 3 of those 20 are hard, and you might blank on dynamic programming or binary search under pressure. That's where StealthCoder runs invisibly during your assessment, surfacing working solutions if you hit a wall on Median of Two Sorted Arrays or Make Array Non-decreasing.
Top problems at VMware
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Make Array Non-decreasing or Non-increasing | HARD | 100.0 | 65% | Dynamic Programming · Greedy |
| 02 | Break a Palindrome | MEDIUM | 100.0 | 52% | String · Greedy |
| 03 | Find Palindrome With Fixed Length | MEDIUM | 100.0 | 37% | Array · Math |
| 04 | Median of Two Sorted Arrays | HARD | 87.6 | 44% | Array · Binary Search · Divide and Conquer |
| 05 | Best Time to Buy and Sell Stock | EASY | 83.2 | 55% | Array · Dynamic Programming |
| 06 | Two Sum | EASY | 77.8 | 56% | Array · Hash Table |
| 07 | Course Schedule | MEDIUM | 70.9 | 49% | Depth-First Search · Breadth-First Search · Graph |
| 08 | Reverse Nodes in k-Group | HARD | 61.1 | 63% | Linked List · Recursion |
| 09 | Next Permutation | MEDIUM | 61.1 | 43% | Array · Two Pointers |
| 10 | Search in Rotated Sorted Array | MEDIUM | 61.1 | 43% | Array · Binary Search |
| 11 | LRU Cache | MEDIUM | 61.1 | 45% | Hash Table · Linked List · Design |
| 12 | Longest Common Prefix | EASY | 61.1 | 45% | String · Trie |
| 13 | Intersection of Two Linked Lists | EASY | 61.1 | 61% | Hash Table · Linked List · Two Pointers |
| 14 | Integer to Roman | MEDIUM | 61.1 | 69% | Hash Table · Math · String |
| 15 | Koko Eating Bananas | MEDIUM | 61.1 | 49% | Array · Binary Search |
| 16 | Longest Palindromic Substring | MEDIUM | 61.1 | 36% | Two Pointers · String · Dynamic Programming |
| 17 | Time Based Key-Value Store | MEDIUM | 61.1 | 49% | Hash Table · String · Binary Search |
| 18 | Course Schedule II | MEDIUM | 61.1 | 53% | Depth-First Search · Breadth-First Search · Graph |
| 19 | Copy List with Random Pointer | MEDIUM | 61.1 | 61% | Hash Table · Linked List |
| 20 | Rotting Oranges | MEDIUM | 61.1 | 57% | Array · Breadth-First Search · Matrix |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual VMware OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- array8 · 40%
- hash table6 · 30%
- string5 · 25%
- binary search4 · 20%
- linked list4 · 20%
- dynamic programming3 · 15%
- breadth first search3 · 15%
- two pointers3 · 15%
- depth first search2 · 10%
- graph2 · 10%
Arrays dominate the problem set, so your first move is locking down array-based patterns: two-pointer work, binary search on sorted arrays, and greedy manipulation. Hash tables are your second pillar, especially when combined with linked lists (LRU Cache is the canonical hard one here). String problems are lighter in volume but show up, often paired with greedy or math. The hard problems target dynamic programming and complex array transformations; these are where most candidates lose time. Binary search appears 4 times across different contexts (rotated arrays, median of two sorted arrays, Koko eating bananas), so drilling that pattern pays off fast. If you haven't solved Reverse Nodes in k-Group or Course Schedule before, StealthCoder handles those graph and recursion curveballs live during the OA.
Companies with similar patterns
If you prepped for VMware, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass VMware.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
VMware interview FAQ
How many array problems should I solve before the VMware assessment?+
Array appears in 8 of 20 problems reported. Prioritize Two Sum, Best Time to Buy and Sell Stock, Median of Two Sorted Arrays, and Search in Rotated Sorted Array. You're looking at solid coverage with 5 to 7 problems drilled end-to-end, then rely on pattern recognition for the rest.
Is binary search really that important for VMware?+
It appears in 4 of your 20 problems, often disguised inside array and math contexts. Koko Eating Bananas and Median of Two Sorted Arrays are classic binary search setups. If you don't have that pattern locked, you'll waste 15 minutes per problem. Drill it hard.
What's the deal with the hard problems VMware asks?+
Three hard problems in a pool of 20 means you might face one. Make Array Non-decreasing (dynamic programming and greedy), Median of Two Sorted Arrays (binary search), and Reverse Nodes in k-Group (linked-list recursion) are the reported ones. You can't prep all three equally, so know which you're fastest at and skip the others if they show up.
Should I study linked lists or hash tables first?+
Hash tables appear in 6 problems; linked lists in 4. Start hash tables. LRU Cache combines both, so once you understand hash-table fundamentals, that design problem clicks faster. Linked-list work (especially Reverse Nodes in k-Group) is trickier and lower frequency.
How much time should I spend on graph and topological sort?+
Graph and topological sort each appear twice in the reported set. Course Schedule is the main one. Don't panic here. One solid BFS/DFS implementation and a cycle-detection pattern cover both. It's lower frequency than array or hash table, so don't sacrifice those fundamentals.