Leetcode Problem - Word Subsets

Problem Statement You are given two string arrays words1 and words2. A string b is a subset of string an if every letter in b occurs in an including multiplicity. For example, "wrr" is a subset of "warrior" but is not a subset of "world". A string a ...