Available question text
Given a list of words, a multiset of available letters, and per-letter scores, select a subset of words (each used at most once) whose combined letter counts do not exceed the available letters to maximize the total score. With words.length ≤ 14, this is typically solved by exploring subsets via bitmasking or backtracking while checking letter-frequency constraints.
Related questions
Continue with questions that share topics or the same question type.
- Find and Count Maximum-Score Grid Paths
Coding · Dynamic Programming · Grids & Matrices
- Find the Maximum Divisibility Score
Coding
- Find the Maximum Factor Score of Array
Coding
- Find Words That Can Be Formed by Characters
Coding
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 1255. Maximum Score Words Formed by Letters
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source