During pair programming, the interviewer asks you to compare two lists of merchant tags and quantify their similarity.
Implement a Python function that takes two lists of strings and returns their Jaccard similarity score.
Convert both lists to sets, then compute |A ∩ B| ÷ |A ∪ B|.