AI Features

Solution: Find Words That Can Be Formed by Characters

Let's solve the Find Words That Can Be Formed by Characters problem using the Knowing What to Track pattern.

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:

  • 1≤1 \leq words.length ≤1000\leq 1000

  • 1≤1 \leq words[i].length, chars.length ...