## VMWare Inc Interview Question for Software Engineer / Developers

Team: Cloud Resource Management
Country: United States
Interview Type: Phone Interview

Comment hidden because of low score. Click to expand.
1
of 1 vote

Levenshtein distance (or Word Distance) problem.

Comment hidden because of low score. Click to expand.
1
of 1 vote

The operation of diff is based on solving the longest common subsequence problem.
In this problem, you have two sequences of items:
a b c d f g h j q z
a b c d e f g i j k r x y z
and you want to find a longest sequence of items that is present in both original sequences in the same order. That is, you want to find a new sequence which can be obtained from the first sequence by deleting some items, and from the second sequence by deleting other items. You also want this sequence to be as long as possible. In this case it is
a b c d f g j z
From a longest common subsequence it's only a small step to get diff-like output: if an item is absent in the subsequence but present in the original, it must have been deleted. (The '–' marks, below.) If it is absent in the subsequence but present in the second sequence, it must have been added in. (The '+' marks.)
e h i q k r x y
+ - + - + + + +

Comment hidden because of low score. Click to expand.
0
of 0 vote

opensource.apple.com/source/gnudiff/gnudiff-10/diffutils/diff.c

Comment hidden because of low score. Click to expand.
0
of 0 vote

opensource.apple.com/source/gnudiff/gnudiff-10/diffutils/diff.c

Comment hidden because of low score. Click to expand.
0
of 0 vote

Longest Common Subsequence
en.wikipedia.org/wiki/Diff

Comment hidden because of low score. Click to expand.
0
of 0 vote

Levenshtein distance (or Word Distance) problem.

Comment hidden because of low score. Click to expand.
0
of 0 vote

Levenshtein distance (or Word Distance) problem.

Comment hidden because of low score. Click to expand.
0
of 2 vote

Longest Common Subsequence

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.