Search
⌘K

Leetcode 737. Sentence Similarity II

Given two equal-length word arrays and a list of similar word pairs where similarity is transitive, determine whether each pair of words at the same index are equivalent (identical or connected through a chain of similarities); this is typically solved by building connectivity (union-find or graph traversal) among words.

Asked at:

Google

Google


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Late December, 2024

Google

Google

Mid-level

Sentence Similarity II

Comments

Your account is free and you can post anonymously if you choose.