Problem database last updated: June 20, 2025
19 problems · 4 Easy, 13 Medium, 2 Hard · Ranked #97 of 458
4 Easy
21% · avg 23%
13 Medium
68% · avg 59%
2 Hard
11% · avg 18%
Based on 19 reported problems, VMware interviews are in line with industry averages - 11% Hard vs 18% overall. The majority (68%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, VMware puts unusual emphasis on topological-sort (10.5% of problems, 8.9x the industry average), graph (10.5% of problems, 3.6x the industry average), linked-list (21.1% of problems, 2.9x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (47.4%), string (26.3%), hash-table (26.3%), binary-search (21.1%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Find Palindrome With Fixed Length Given an integer array queries and a positive integer intLength, return an array answer where answer[i] is either the queries[i]th smallest positive palindrome... | Medium | Very Likely | arraymath | Solve |
Break a Palindrome Given a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulting string... | Medium | Very Likely | stringgreedy | Solve |
Median of Two Sorted Arrays Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. | Hard | Very Likely | arraybinary-searchdivide-and-conquer | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Very Likely | arraydynamic-programming | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Course Schedule There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b... | Medium | Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Integer to Roman Seven different symbols represent Roman numerals with the following values: | Medium | Likely | hash-tablemathstring | Solve |
Intersection of Two Linked Lists Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at al... | Easy | Likely | hash-tablelinked-listtwo-pointers | Solve |
Next Permutation A permutation of an array of integers is an arrangement of its members into a sequence or linear order. | Medium | Likely | arraytwo-pointers | Solve |
Search in Rotated Sorted Array There is an integer array nums sorted in ascending order (with distinct values). | Medium | Likely | arraybinary-search | Solve |
Reverse Nodes in k-Group Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. | Hard | Likely | linked-listrecursion | Solve |
Time Based Key-Value Store Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain... | Medium | Likely | hash-tablestringbinary-search | Solve |
Course Schedule II There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b... | Medium | Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Rotting Oranges You are given an m x n grid where each cell can have one of three values: | Medium | Likely | arraybreadth-first-searchmatrix | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Copy List with Random Pointer A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null. | Medium | Likely | hash-tablelinked-list | Solve |
Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. | Easy | Likely | arraystringtrie | Solve |
Koko Eating Bananas Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. | Medium | Likely | arraybinary-search | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Find Palindrome With Fixed Length
SolveGiven an integer array queries and a positive integer intLength, return an array answer where answer[i] is either the queries[i]th smallest positive palindrome...
Break a Palindrome
SolveGiven a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulting string...
Median of Two Sorted Arrays
SolveGiven two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Course Schedule
SolveThere are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...
Integer to Roman
SolveSeven different symbols represent Roman numerals with the following values:
Intersection of Two Linked Lists
SolveGiven the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at al...
Next Permutation
SolveA permutation of an array of integers is an arrangement of its members into a sequence or linear order.
Search in Rotated Sorted Array
SolveThere is an integer array nums sorted in ascending order (with distinct values).
Reverse Nodes in k-Group
SolveGiven the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.
Time Based Key-Value Store
SolveDesign a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain...
Course Schedule II
SolveThere are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...
Rotting Oranges
SolveYou are given an m x n grid where each cell can have one of three values:
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Copy List with Random Pointer
SolveA linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.
Longest Common Prefix
SolveWrite a function to find the longest common prefix string amongst an array of strings.
Koko Eating Bananas
SolveKoko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent VMware interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
VMware interviews focus heavily on array, string, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. VMware interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
VMware has been reported to ask 19 distinct coding problems. The most common topics are array, string, hash-table. 4 are Easy difficulty, 13 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 19 reported problems, VMware interviews are in line with industry averages - 11% Hard vs 18% overall. 68% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real VMware coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a VMware interview with AIarrow_forward
