VMware Software Engineer Phone Screen Questions

Hi , So recently I joined vmware as MTS2 at Pune office and I would like to share my interview experience back to community. So the position was a CPP/ windows...

Graduation: B.Tech. in IT from IIIT Allahabad Experience: 1 year 8 months Position: Technical Analyst at Goldman Sachs Location: Bengaluru, Karnataka, India Date: January 25, 2023 I recently applied for an MTS-2 role in VMWare...

Round 1 - 1. Add two linked lists and you cannot reverse a linked list and then add. 2. Detect cycle in undirected graph 3. Array of numbers given find minimum missing positive...

Education: B.Tech Current Experience: 7 years exp in non FAANG Interview Dates: March 2022 Round 1 ( DS & Algo) 1. Find diameter of Binary tree 2. N celebrity problem Round 2 (...

Position: MTS-3 at VMware Location: Bengaluru, India Date: March 2022 The interview process and format of each interview: Round 1 (Coding): - Group Anagrams - LIS - DP followed by Recursive solution Round 2 (Coding): -...

Applied through Linkedin. Technical round 1 Started with my brief introduction. https://leetcode.com/problems/reverse-integer/ A variation of :https://leetcode.com/problems/find-greatest-common-divisor-of-array/ Java questions: Hashmap, Multithreading, ArrayList vs LinkedList, HashCode Equals. Write CRUD API structures for employee. SQL questions based on joins. Technical Round 2 Started...

Interviewed for the TKG team ## Round 1 - Questions on work experience. - Questions related to kubernetes architecture. - Was given a code snippet from kubernetes codebase, and asked to reverse engineer and...

YOE: 5 VC Round 1 Coding: 1. Find product of all elements except self for each index in a given array. 2. Given a grid, find max score you can get if you start...

Hi All, I recently interviewed at VMWare for MTS-1 role and I had 4 tech + 1 Managerial rounds. All virtual rounds happened over a 2 day period. You can use any...

I was contacted by recruiter over linkedin for Senior Lead Software Engineer for Banglore location. I asked them for preparation time as I had holidays planned too. It took around...

Round 1: Client: Dish, Vodaphone Question 1: /* Input in json format is given as below: [{ "id":"P1", "dependency":["P2", "P3"] }, { "id":"P2", "dependency":["P3"] }, { "id":"P3", "dependency":[...

Location: B\'lore On: July 2021 Round1: Q1: Find a number in BST, had to complete the method. Q2: Maintain top \'K\' elements for stream of coming numbers Extension: Maintain top K percentile for stream of...

Status : New grad ,CS at Tier 1 College Location : Banglore Position : Member of Technical Staff 1 Process : Apt/Coding Round 1 : Time limit for each section : 2:30 hours 5 sections...

Position: New Grad Validate a json and return true or false. Example: Input: { "glossary":{ "title":"exampleglossary", "GlossDiv":{ "title":"S", "GlossList":{ "GlossEntry":{ "ID":"SGML", "SortAs":"SGML", "GlossTerm":"StandardGeneralizedMarkupLanguage", "Acronym":"SGML", "Abbrev":"ISO8879:1986", "GlossDef":{ "para":"Ameta-markuplanguage,usedtocreatemarkuplanguagessuchasDocBook.", "GlossSeeAlso":[...

YOE: 1.8 I recieved a call from VM-Ware few days back and interview was scheduled for next day. Round 1: https://leetcode.com/problems/max-area-of-island/ Solution do simple DFS and keep track of maximum island encountered. ...

Phone Interview: https://leetcode.com/problems/valid-parentheses/ https://leetcode.com/problems/clone-graph/ **Onsite Interview: Round 1: Problem Solving (1 hour) https://leetcode.com/problems/maximum-width-of-binary-tree/ https://www.geeksforgeeks.org/maximum-sum-path-across-two-arrays/ Round 2: System Design (1 hour) * Design Instagram Round 3: * Lunch with hiring manager with some behavioral questions. (1 hour) ...

Please define a Custom Datastructure to represent non-negative integers of unlimited length and implement "add" operation for two instances of this type. "1234" + "567" = "1801" "99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999998888888888888888 8888888888888888888888888888888877777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777"+"1" = "99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999998888888888888888 8888888888888888888888888888888877777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777778"...

Round 1: Write Java code for below, my approach was to build a graph and then compute the in degree of all the vertices then ask was to implement it in...

Recruiter contacted me in first week of May through email. Round 1 : coding round 1) Validate IPV4 2) Kadanes algorithm This round went well except for a small mistake in...

Status: 7y experience in product development Position: SSE Location: India Date: July 2021 Round 1- Brief project discussion Coding - Given a number N and K, count total possible ways to reach sum (N) by using numbers...