Search⌘ K
AI Features

Solution: Find Words That Can Be Formed by Characters

Explore how to determine which words can be formed using only characters from a given string, applying frequency counting and comparison techniques. Understand how to efficiently build and use frequency maps to track character availability, enabling you to solve this problem with clear logic and optimal performance.

Statement

You are given an array of strings words and a string chars.

A string in words is considered good if it can be formed using only the characters available in chars, where each character in chars may be used at most once per word.

Return the sum of the lengths of all good strings in words.

Constraints:

  • 11 \leq words.length 1000\leq 1000

  • 11 \leq words[i].length, chars.length ...