How Many Sentences?

Problem Overview

• Core task: For each sentence, count how many distinct sentences can be formed by replacing each word with any of its anagrams from the given word set.
• Inputs/Outputs: wordSet[n], sentences[m]; return an int[m] with counts. Constraints: n ≤ 1e5, word length ≤ 20, m ≤ 1000, sentence length 3–20 words.
• Domain: text processing with anagrams in natural language; practical string counting problem.
• From Zscaler interviews; a common coding interview interview question.