Filter interviews by
Clear (1)
I applied via Campus Placement
Linked list one easy question
Can't disclose NDA it was regarding class diagram
My favorite company is Google.
Innovative technology
Diverse range of products and services
Strong focus on user experience
IP address is converted to URL through DNS resolution process involving multiple steps.
IP address is obtained from the domain name system (DNS) server when a user enters a URL in a web browser.
The DNS server looks up the IP address associated with the URL in its database.
The DNS server then returns the IP address to the user's device, allowing it to establish a connection to the server hosting the website.
For example, ...
I chose this company because of its innovative projects, strong company culture, and opportunities for growth.
Innovative projects: I am excited about the cutting-edge technology being developed at Mts.
Strong company culture: I value a supportive and collaborative work environment.
Opportunities for growth: I see potential for career advancement and skill development here.
I want to improve my problem-solving skills by learning new programming languages and technologies.
Learn a new programming language like Python or Java
Explore new technologies like cloud computing or machine learning
Practice solving coding challenges on platforms like LeetCode or HackerRank
Reverse a binary tree by swapping left and right child nodes recursively.
Start from the root node
Swap the left and right child nodes of each node recursively
Continue until all nodes have been swapped
I applied via LinkedIn and was interviewed before Oct 2022. There were 4 interview rounds.
Dsa leetcode medium was asked
Same as the first round, dsa
VMware Software interview questions for designations
I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.
Find the missing character in two strings with linear time complexity and constant space complexity.
Iterate through both strings simultaneously and XOR the ASCII values of characters.
The missing character will be the XOR result with the ASCII value of the last character in the longer string.
Example: s1 = 'abcd', s2 = 'abcde', missing character is 'e'.
Search for target value in a sorted rotated array efficiently.
Use binary search to find the pivot point where the array is rotated.
Then perform binary search on the appropriate half of the array to find the target value.
Handle cases where the target value is at the pivot point or not found.
Decorators in Python are functions that modify the behavior of other functions. Function objects are objects that can be assigned to variables, passed as arguments, and returned from other functions.
Decorators are used to add functionality to existing functions without modifying their code.
They are defined using the @ symbol followed by the decorator function name above the function definition.
Function objects in Pytho...
Sort zeros to the end of the array of strings
Iterate through the array and move all zeros to the end
Use two pointers approach to swap elements
Example: Input: ['1', '0', '3', '0', '5'], Output: ['1', '3', '5', '0', '0']
Get interview-ready with Top VMware Software Interview Questions
I applied via Referral and was interviewed before Jul 2023. There was 1 interview round.
OOPS concepts refer to Object-Oriented Programming principles like Inheritance, Encapsulation, Polymorphism, and Abstraction.
Inheritance: Allows a class to inherit properties and behavior from another class.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hiding the complex implementation detail
I applied via LinkedIn and was interviewed before Jul 2023. There were 2 interview rounds.
Techinical questions were asked and basic oops
Top trending discussions
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
I was interviewed before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.
You are provided with a binary tree consisting of N
nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all possible paths.
Handle cases where nodes have negative values.
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal, and update the intersection array.
Return the intersection array as the result.
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until finding a greater element or stack is empty
Given three integers X
, C
, and Y
, where X
is the first term of an arithmetic sequence with a common difference of C
, determine if Y
is part of this arithmetic sequ...
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C
Check if Y is equal to any term in the sequence to determine if it belongs to the sequence
Return 'True' if Y belongs to the sequence, otherwise return 'False'
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
A process is a program in execution, consisting of code, data, and resources.
Threads are smaller units within a process that can execute independently.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, while threads ar...
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
Given an array/list arr
of size n
, determine the maximum product possible by taking any subset of the array/list arr
. Return the result modulo 10^9+7
since the product ...
Find the maximum product of a subset of an array modulo 10^9+7.
Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.
Handle cases where the array contains zeros separately.
Return the maximum product modulo 10^9+7.
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
...Implement a function to update 'next' pointers in a complete binary tree.
Iterate level by level using a queue
Connect nodes at each level using 'next' pointers
Handle null nodes appropriately
Ensure the tree is a complete binary tree
Round duration - 50 Minutes
Round difficulty - Medium
This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum element at each level.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is t...
You are given an integer array arr
of size N
. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Split the array whenever the last occurrence of an element is found.
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.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
Some of the top questions asked at the VMware Software Mts Software Engineer interview -
based on 8 interviews
1 Interview rounds
based on 20 reviews
Rating in categories
Member Technical Staff
564
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Member of Technical Staff
509
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
399
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
255
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Staff Member 3
250
salaries
| ₹0 L/yr - ₹0 L/yr |
Microsoft Corporation
Oracle
IBM
SAP