NeetCode #685LC-691Hard1-D Dynamic Programming
← Back to All Problems#685 · #691 · Stickers to Spell Word(贴纸拼词)
📌 Problem Statement & Constraints
Given an array of
stickers (each a string of lowercase letters) and a target string, return the minimum number of stickers needed to spell the target, or -1 if it is impossible. Each sticker may be used multiple times, and each use consumes its letters. Constraints: 1 <= stickers.length <= 50, 1 <= stickers[i].length <= 10, 1 <= target.length <= 15.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!