Meta Unknown Leetcode || Stickers to Create Poster
- Posted
- 6 Jul 2025
Summary
This post describes a variant of LeetCode 691, 'Stickers to Spell Word,' often encountered in Meta interviews. The specific twist involves using only a single sticker to recreate a target poster, which the author notes simplifies the original problem.
How it went
Hey y’all, got a solution for a variant of LC691 Stickers to Spell Word. Now, Meta will never ask you the OG problem but rather, this prompt: what if you only had one sticker? How many stickers do you minimally need to recreate the poster?
Although there are a few edge cases, this actually simplifies the original problem. Wishing everyone good luck on their interviews!
Check it out (or not!):
Unknown Leetcode, Stickers to Create Poster (Link)
Reference to all of the Meta Variants, Playlists & Unknowns: https://leetcode.com/discuss/post/6615244/meta-variant-compilation-by-codingwithmi-0pm7/
Questions asked (1)
- 01
Stickers to Spell Word (Single Sticker Variant)
Data Structures & Algorithms
Open the problemThis problem is a variant of LeetCode 691, 'Stickers to Spell Word'. The specific prompt is: Given a target string
targetand a single sticker stringsticker, determine the minimum number of times this one sticker needs to be used to recreate thetargetstring. The post implies this simplifies the original problem. An illustrative image is also provided: