VMware Interview Questions — 20 DSA Problems

19 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked VMware LeetCode questions for software engineering interviews.

• Find Palindrome With Fixed Length (MEDIUM) — Array, Math
• Make Array Non-decreasing or Non-increasing (HARD) — Dynamic Programming, Greedy
• Break a Palindrome (MEDIUM) — String, Greedy
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Two Sum (EASY) — Array, Hash Table
• Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Time Based Key-Value Store (MEDIUM) — Hash Table, String, Binary Search, Design
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Next Permutation (MEDIUM) — Array, Two Pointers
• Reverse Nodes in k-Group (HARD) — Linked List, Recursion
• Longest Common Prefix (EASY) — String, Trie
• Integer to Roman (MEDIUM) — Hash Table, Math, String
• Koko Eating Bananas (MEDIUM) — Array, Binary Search
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Copy List with Random Pointer (MEDIUM) — Hash Table, Linked List
• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Intersection of Two Linked Lists (EASY) — Hash Table, Linked List, Two Pointers