AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
VMware Software Member Technical Staff Interview Questions, Process, and Tips
Top VMware Software Member Technical Staff Interview Questions and Answers
- 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 g ...read more
- Q2. 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 anag ...read more
- Q3. Which data structure would you use to implement the undo and redo operation in a system?
VMware Software Member Technical Staff Interview Experiences
9 interviews found
Anonymous
(2 Questions)
- Q1. Merge sort, check duplicates
- Q2. String related questions
I applied via Company Website and was interviewed in Oct 2023. There were 2 interview rounds.
(1 Question)
- Q1. Merge sort,strings questions
(1 Question)
- Q1. Mangerial Questions
Selected
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
1 hour coding interview where medium level DSA problems were asked.
1 hour interview. 1 coding question and some questions related to cloud were asked.
(1 Question)
- Q1. General discussion about the role and the work I will be doing.
Interview Preparation Tips
Selected
I applied via LinkedIn and was interviewed before Oct 2022. There were 3 interview rounds.
Oracle RDBMS concepts, core java, data structures
(1 Question)
- Q1. More like a discussion
VMware Software interview questions for designations
I applied via Recruitment Consulltant and was interviewed in Nov 2021. There were 5 interview rounds.
Basic Coding questions around LRU Cache and Top View Tree Traversal
Multi threading and Internal Working of Hash Map!
(1 Question)
- Q1. Behavioural Questions
(1 Question)
- Q1. Behavioural Questions
(1 Question)
- Q1. Behavioural Questions
Interview Preparation Tips
- Data Structures
- Java
Get interview-ready with Top VMware Software Interview Questions
I appeared for an interview in Nov 2020.
(1 Question)
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...
- 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
(2 Questions)
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...
- 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
- 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...
(1 Question)
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...
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.
Interview Preparation Tips
Tip 1 : Practice the DSA sheet of 180 commonly asked questions by striver.
Tip 2 : Do Competitive coding regularly, try to be consistent in short contests.
Tip 3 : Revise the core subjects basics regularly.
Tip 1 : Resume must be concise and to the point.
Tip 2 : Never add any fake skill in your resume, because they can ask anything from your skills.
Skills evaluated in this interview
I applied via LinkedIn and was interviewed before Sep 2021. There were 2 interview rounds.
(5 Questions)
- Q1. Question from BST, Stack
- Q2. Multi-threading and concurrency, lock.
- Q3. Interval merge, divider and conquer
- Q4. Project discussion, design discussion
- Q5. Manager discussion for 30 min. This was about work and team.
Interview Preparation Tips
- Operating Systems
- Data Structures
- Algorithms
- System Design
I applied via LinkedIn and was interviewed in Jul 2020. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. I was asked agile and basic java selenium Questions
Interview Preparation Tips
I appeared for an interview before Mar 2021.
(3 Questions)
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
- 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...
- 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
(2 Questions)
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...
- 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...
- 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...
- 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.
Round duration - 30 minutes
Round difficulty - Easy
The HR asked about my hobbies, extra curricular activities and checked my personality.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
15 Questions
- Q1. How to find a loop in a Linked List and how to remove it
- Ans.
To find and remove a loop in a Linked List, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, slow and fast, to detect if there is a loop in the Linked List
If the two pointers meet at some point, there is a loop
To remove the loop, set one of the pointers to the head of the Linked List and move both pointers one step at a time until they meet again
The meeting point is the start of the loop, set the next poi
- Q2. Suppose there is an unsorted array. What will be the maximum window size, such that when u sort that window size, the whole array becomes sorted. Eg, 1 2 6 5 4 3 7 . Ans: 4 (6 5 4 3)
- Ans.
Find the maximum window size to sort an unsorted array.
Identify the longest decreasing subarray from the beginning and longest increasing subarray from the end
Find the minimum and maximum element in the identified subarrays
Expand the identified subarrays until all elements in the array are covered
The length of the expanded subarray is the maximum window size
- Q3. How to find longest last occurring word in a sentence with multiple whitespace
- Ans.
Finding the longest last occurring word in a sentence with multiple whitespace.
Split the sentence into words using whitespace as delimiter
Reverse the list of words
Iterate through the list and find the first occurrence of each word
Calculate the length of each last occurring word
Return the longest last occurring word
- Q4. What is merge sort and Quick sort. Adv and Disadv of each and which one would u use to sort huge list and Y
- Ans.
Merge sort and Quick sort are sorting algorithms used to sort arrays of data.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.
Merge sort has a tim...
- Q5. Define Process &thread
- Ans.
Process is an instance of a program while thread is a subset of a process that can run concurrently with other threads.
A process is a program in execution
A process can have multiple threads
Threads share the same memory space as the process
Threads can run concurrently with other threads within the same process
Examples of processes include web browsers, word processors, and media players
Examples of threads include GUI th
- Q6. What happens when an recursive function is called
- Ans.
A recursive function calls itself until a base case is reached, then returns the result to the previous call.
Each call creates a new instance of the function on the call stack
The function continues to call itself until a base case is reached
Once the base case is reached, the function returns the result to the previous call
The previous call then continues executing from where it left off
- Q7. Solve and code the problem of a ball falling from staircase. Each jump can be of 1 step or 2. Find the number of combination of reaching step N
- Ans.
Code to find number of combinations of reaching step N by ball falling from staircase with 1 or 2 steps per jump.
Use dynamic programming to solve the problem
Create an array to store the number of ways to reach each step
Initialize the array with base cases for steps 0, 1, and 2
Use a loop to fill in the array for steps 3 to N
The number of ways to reach step i is the sum of the number of ways to reach step i-1 and i-2
Retu
- Q8. Puzzle: There is a grid of soldier standing. Soldier ‘A’ is chosen: The tallest men from every column and the shortest among them. Soldier ‘B’ is chosen: The shortest men from every row and the tallest amo...
- Q9. What’s priority queue. How will u make stack and queue with priority queue
- Ans.
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Priority queue is implemented using a heap data structure.
Stack can be implemented using a priority queue by assigning higher priority to the most recently added element.
Queue can be implemented using a priority queue by assigning higher priority to the oldest element.
- Q10. Implement stack using queue
- Ans.
Implementing stack using queue involves using two queues to simulate stack behavior.
Create two queues, q1 and q2.
Push operation: Enqueue the element to q1.
Pop operation: Dequeue all elements from q1 to q2 except the last element. Dequeue and return the last element.
Swap the names of q1 and q2 after each pop operation.
Top operation: Return the last element of q1 without dequeuing it.
isEmpty operation: Check if both q1 a
- Q11. About myself
- Q12. About my family. I mentioned my dad is my idol, so he asked y. M I more like my dad or my mom.
- Q13. My toughest moment in life and how I overcame it
- Ans.
I lost my job during the pandemic and struggled to find a new one
Applied to multiple job openings daily
Networked with former colleagues and industry professionals
Took online courses to improve skills
Maintained a positive attitude and stayed motivated
Eventually landed a new job in a different industry
- Q14. What had I been if I hadn’t been an engg
- Ans.
I would have pursued a career in music or writing.
I have always had a passion for music and writing.
I have played multiple instruments since childhood.
I have written and published short stories and poetry.
I believe creativity is an important aspect of any profession.
- Q15. What do I value most in life. (A real life example)
- Ans.
I value my relationships with loved ones the most.
Spending quality time with family and friends
Making an effort to stay in touch with long-distance loved ones
Prioritizing important events and milestones in their lives
Being there for them during difficult times
Forgiving and working through conflicts to maintain strong bonds
Interview Preparation Tips
Experience: He went
through my CV and asked me something about making an android app. (Note: I had
mentioned Android a couple of times in CV) I explained him how a basic app is
made with model (XML) and layout (Java). He told me about connector which
connects model to layout. Then he asked the two questions. For second ques, I gave a N square approach (dynamic).
He suggested a greedy approach of Order N. It was fitting most cases so I wrote
the code on greedy approach. Turned out, greedy wasn’t the solution anyway.
Doesn’t matter. (Note: Boss is always right!!!)
Round: Technical Interview
Experience: He went
through my CV and asked me about my dropped grades in 12th.In third question, interesting part was, he said me to answer only if I knew it. I replied that I know but the definition isn’t totally memorized and he said to let it go then. (PS: Learn basic defs)
Tips: Ans to 5) is Fibonacci and 6) is A is taller than B
Round: Technical Interview
Experience: He
went through my CV and asked my if I had done Intern in Amazon or Training.
Followed by, he asked me why I didn’t get a PPO there. He then asked me, which
subject I m more confident with: Algo types or OS types. I chose algo.
Tips: Keep your cool and code with confidence. Reason I am saying this is because, he was the senior most interviewer and somehow, he knew the art to stress test you.
Round: HR Interview
Experience: 1)
Be honest
2)
Sit with open palms
3)
Don’t cross your hands or legs(if legs can be
visible)
4)
Keep some back stories ready. Use any names, use your friends story anything to make it real. It will go a long way because nobody is
going to verify it.
5)
Most imp, Be confident about yourself. If you r not
sure of yourself, you would be useless to the company.
General Tips: Code Daily. Practise. Basics are important in such interviews.
Skill Tips: Do refer the previous question sets. It gives you pretty good idea of what's expected of you.
Skills: Algorithm, Puzzle solving, Technical Knowledge, Soft Skills, Data structures
College Name: IIT DHANBAD
Funny Moments: When in first round, I knew greedy approach isn't right, But I went on with it, because I could hear my dad whispering in my ears from behind, Rule 1: Boss is always Right
Rule 2: In case of doubt, refer Rule 1...
Skills evaluated in this interview
VMware Software Interview FAQs
Tell us how to improve this page.
VMware Software Interviews By Designations
- VMware Software Technical Support Engineer Interview Questions
- VMware Software Member Technical Staff Interview Questions
- VMware Software Business Analyst Interview Questions
- VMware Software Software Engineer Interview Questions
- VMware Software Mts Software Engineer Interview Questions
- VMware Software Staff Engineer Interview Questions
- VMware Software Software Developer Interview Questions
- VMware Software Senior Business Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Member of Technical Staff Interview Questions
- Member Technical Interview Questions
- Senior Member Technical Interview Questions
- Team Member Interview Questions
- Associate Member Technical Staff Interview Questions
- Member Technical Staff 1 Interview Questions
- Senior Team Member Interview Questions
- Technical Staff Member 2 Interview Questions
- Show more
VMware Software Member Technical Staff Interview Process
based on 6 interviews
2 Interview rounds
- Coding Test Round - 1
- Coding Test Round - 2
Member Technical Staff Interview Questions from Similar Companies
Fast track your campus placements
VMware Software Member Technical Staff Reviews and Ratings
based on 43 reviews
Rating in categories
|
Member Technical Staff
536
salaries
|  ₹12 L/yr - ₹45 L/yr |
|
Senior Member of Technical Staff
512
salaries
| ₹25 L/yr - ₹72.8 L/yr |
|
Technical Support Engineer
391
salaries
| ₹7.4 L/yr - ₹19 L/yr |
|
Technical Staff Member 3
248
salaries
| ₹17 L/yr - ₹54.1 L/yr |
|
Business Analyst
231
salaries
| ₹4.8 L/yr - ₹19 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer
- Home >
- Interviews >
- VMware Software Interview Questions >
- VMware Software Member Technical Staff Interview Questions
