Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 691. Stickers to Spell Word
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source