VMware Software Member Technical Staff Interview Questions, Process, and Tips

Basic Coding questions around LRU Cache and Top View Tree Traversal

Multi threading and Internal Working of Hash Map!

Q1. Behavioural Questions
Add your answer

Q1. Behavioural Questions
Add your answer

Q1. Behavioural Questions
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

The round was audio and video proctored, since it was virtual.
It lasted for 90 minutes.
The questions was of medium level.

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. 
Find the next smallest palindrome greater than a given number represented as a string.
• Iterate from the middle of the number and mirror the left side to the right side to create a palindrome

• If the resulting palindrome is greater than the input number, return it

• Handle cases where the number has all 9s and requires a carry over to the left side
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was Technical round of 60 minutes,
the interviewer was very nice person.

Q1. 
Check Permutation Problem Statement
Given two strings 'STR1' and 'STR2', determine if they are anagrams of each other.
Explanation:
Two strings are considered to be anagrams if they contain the same cha...read more
Ans. 
Check if two strings are anagrams of each other by comparing their characters.
• Create a character frequency map for both strings and compare them.

• Sort both strings and compare if they are equal.

• Use a hash set to store characters from one string and remove them while iterating through the other string.

• Check if the character counts of both strings are equal.

• Example: For input 'listen' and 'silent', the output should be tr
Answered by AI
Add your answer
Q2. Which data structure would you use to implement the undo and redo operation in a system?
Ans. 
Use a stack data structure for implementing undo and redo operations.
• Stack data structure is ideal for implementing undo and redo operations as it follows Last In First Out (LIFO) principle.

• Push the state of the system onto the stack when an action is performed, allowing for easy undo by popping the top element.

• Redo operation can be implemented by keeping a separate stack for redo actions.

• Example: In a text editor, eac...read more
Answered by AI
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Medium

It was a resume based Interview round technical - 2
the interviewer was helping and humble.

Q1. Can you design the bank architecture using basic OOP concepts in any programming language?
Ans. 
Yes, I can design the bank architecture using basic OOP concepts in any programming language.
• Create classes for entities like Bank, Account, Customer, Transaction, etc.

• Use inheritance to model relationships between entities (e.g. SavingsAccount and CheckingAccount inheriting from Account).

• Implement encapsulation to hide internal details of classes and provide public interfaces for interaction.

• Utilize polymorphism to al...read more
Answered by AI
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

It was the easiest round.
And it was supposed to be the same.
It was an HR round.

Q1. Question from BST, Stack
Add your answer
Q2. Multi-threading and concurrency, lock.
Add your answer
Q3. Interval merge, divider and conquer
Add your answer
Q4. Project discussion, design discussion
Add your answer
Q5. Manager discussion for 30 min. This was about work and team.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Th interviewer asked me questions related to various topics of OS, Data Structures and Algorithm.
Tips: Have a strong hold on topics of OS like segmentation and buddy systems.

Q1. What is segmentation?
Ans. 
Segmentation is the process of dividing a larger entity into smaller parts or segments.
• Segmentation is commonly used in image processing to separate objects of interest from the background.

• It is also used in marketing to divide a target market into smaller groups based on demographics, behavior, or other factors.

• In networking, segmentation refers to dividing a network into smaller subnetworks to improve performance and
Answered by AI
Add your answer
Q2. What are the advantages and disadvantages of the buddy system?
Ans. 
The buddy system has advantages like increased safety and support, but also drawbacks like dependency and lack of independence.
• Advantages: increased safety, support, accountability, motivation

• Disadvantages: dependency, lack of independence, potential for conflicts

• Example: In a buddy system at work, colleagues can support each other in completing tasks and provide motivation to stay on track.

• Example: However, relying to...read more
Answered by AI
Add your answer
Q3. What is a page fault?
Ans. 
A page fault occurs when a program tries to access a page of memory that is not currently in physical RAM.
• Occurs when a program tries to access a page of memory not in physical RAM

• Results in the operating system needing to retrieve the page from disk

• Can lead to a temporary pause in program execution
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of questions of heap, Towers of hanoi and other questions related to CV.
Tips: Time complexity analysis of Towers of Hanoi Problem is important. Good skillset in DS and Algorithms, Bit Manipulation.

Q1. 
Tower of Hanoi Problem Statement
You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...read more
Ans. 
Tower of Hanoi problem where 'N' disks need to be moved to another rod following specific rules in less than 2^N moves.
• Implement a recursive function to move disks from one rod to another following the rules.

• Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.

• Maintain a count of moves and track the movement of disks in a 2-D array/list.

• Ensure that larger disks are not placed on...read more
Answered by AI
Add your answer
Q2. 
Convert Array to Min Heap Task
Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.
A min-binary heap is a complete binary tree where each internal node's va...read more
Ans. 
Convert the given array into a min-binary heap by modifying the array elements.
• Iterate through the array and heapify each node starting from the last non-leaf node to the root node.

• For each node, compare it with its children and swap if necessary to satisfy the min-heap property.

• Continue this process until the entire array is converted into a min-heap.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The HR asked about my hobbies, extra curricular activities and checked my personality.