Leetcode 691. Stickers to Spell Word

Given sticker words (each supplying a multiset of letters, available in unlimited quantity), find the minimum number of stickers whose combined letters can be cut and rearranged to form the target string, or return -1 if impossible. This is a combinatorial multiset-cover optimization over letter counts (small target length), typically solved with recursion/memoization or DP.