Available question text
Given a list of words and a pool string chars, return the sum of lengths of all words that can be formed from chars where each character in chars can be used at most once per word. The core task is to compare each word's letter frequencies against the available frequencies in chars (i.e., a multiset comparison).
Related questions
Continue with questions that share topics or the same question type.
- Solve this impossible leetcode hard problem that involves figuring out an alogrithms that can crack any RSA encryption in O(1) time.
All jokes aside, it was a question about topological sorting. You have to find manager and employees given a list of their names and ids and print them out in a pyramid sideway pyramid.
Coding
- The "Alien Dictionary" problem is a classic LeetCode question (specifically LeetCode Problem 269) that requires determining the alphabetical order of characters in a new language given a list of words sorted according to that language's rules. This is typically solved using graph theory and topological sorting (Kahn's algorithm or DFS).
Coding
- All Valid Triplets That Can Represent a Country
Coding
- Build Array Where You Can Find The Maximum Exactly K Comparisons
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 1160. Find Words That Can Be Formed by Characters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source