Amazon Interview Question
- 0of 0 votes
AnswersIdeal goal:
- stella.rafailov August 23, 2016 in India
Given data set of strings divide them into equivalence classes such that the equivalence relation is fuzzyMatchingOfString
Problem: as far as I know there isn’t a relation function fuzzyMatchingOfString such that it is transitive, i.e. given A,B,C and fuzzyMatchingOfString(A,B), fuzzyMatchingOfString(B,C) does not imply fuzzyMatchingOfString(A,C)
e.g. foo ~ goo and goo~gol but not foo~gol
given that I think we have to compromise about our goal and create a set to each string In our data set – that is n^2 for each run when the basic action is fuzzyMatchingOfString| Report Duplicate | Flag | PURGE
Amazon Algorithm
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
Interview Type: In-Person
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.