Spell a Target with the Fewest Reusable Stickers
Company: ByteDance
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Find the minimum number of reusable word stickers needed to assemble a lowercase target when letters may be cut and rearranged. Account for repeated letters, unused sticker characters, impossible targets, and the empty target.
Read the full ByteDance Software Engineer interview experience this question came from