## VMware Interview Experience | Set 13 (On-Campus): Rnd_developer

Round 1: Online Round on Hirepro There were 40 questions and 4 sections: Section 1: 10 questions from Aptitude(time & work, numbers etc https://www.geeksforgeeks.org/placements-gq/ )to be… Read More »

## VMWare interview experience for App. Dev/MTS (On-campus Aug. 2018)

VMWare visited our campus to recruit freshers to offer 6 months internship + full time employment for the positions of Application Developer / Member of… Read More »

## VMware On-Campus for Internship

Round 1: Online round. Around 60 people attended. 60 Multiple choice questions in total from Data Structures, Operating Systems, Computer Networks, C, C++, Java, Quantitative Aptitude.… Read More »

## Longest Common Prefix Matching | Set-6

Given a set of strings, find the longest common prefix. Examples: Input: str[] = {geeksforgeeks, geeks, geek, geezer} Output: gee Input: str[] = {apple, ape,… Read More »

## VMWare Interview Experience | Set 13 (Staff Engineer – UI)

I applied through referral. I got call within a week. Total 7 rounds. First round was telephonic, asked some basic javascript questions followed by below… Read More »

## VMware Interview Experience | Set 12 (On-Campus)

Round 1: Total Time – 90 mins Number of Sections – 4 Platform Used – HirePro Aptitude(Data Interpretation and Number System, Set Theory, Equations, Averages,… Read More »

## Diameter of a Binary Tree in O(n) [A new method]

The diameter of a tree is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two… Read More »

## VMware Interview Experience | Set 11 (On-Campus)

Round 1 : Online round via hirepro Round 1 (90 mins): 4 Sections. Section 1: Time : 15 mins. 10 MCQ’s , Aptitude Section Aptitude… Read More »

## VMware Interview Experience | Set 10 (On-Campus for Internship)

VMware conducted first round via hirepro Round 1 (90 mins): There were 4 sections .Section 1 had 10 Aptitude questions ( Boats & Streams, Profit… Read More »

## Diameter of a tree using DFS

The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two leaves in the tree. The… Read More »

## Reverse a Linked List in groups of given size | Set 2

Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Inputs: 1->2->3->4->5->6->7->8->NULL and k… Read More »

## Merge k sorted linked lists | Set 2 (Using Min Heap)

Given k sorted linked lists each of size n, merge them and print the sorted output. Examples: Input: k = 3, n = 4 list1… Read More »

## Union and Intersection of two linked lists | Set-3 (Hashing)

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More »

## Union and Intersection of two linked lists | Set-2 (Using Merge Sort)

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More »

## Vmware Interview Experience | Set 9 (Internship (R&D))

Vmware conducted their online exam via hirepro. Round 1 : There were 3 sections quants, Technical questions and OOPs based questions, no section had negative… Read More »