Why Count Words with Given Prefix in DSA C#?

The Big Idea

What if you could find all words starting with your favorite letters instantly, no matter how big the list?

The Scenario

Imagine you have a huge list of words and you want to find out how many words start with a certain set of letters, like "pre". Doing this by checking each word one by one is like searching for a friend in a crowd by asking every single person their name.

The Problem

Checking each word manually is slow and tiring. It takes a lot of time if the list is big. Also, it's easy to make mistakes or miss some words because you have to look at every single one.

The Solution

Using a special structure that organizes words by their letters lets you quickly jump to the part where words start with your prefix. This way, you don't have to check every word, just the ones that matter.

Before vs After

✗ Before

int count = 0;
foreach (string word in words) {
  if (word.StartsWith(prefix)) count++;
}

✓ After

int count = trie.CountWordsWithPrefix(prefix);

What It Enables

This lets you instantly find how many words start with any prefix, even in huge word lists, making searches fast and easy.

Real Life Example

When you type in a search box, the system suggests words starting with what you typed. It uses this method to quickly count and find matching words.

Key Takeaways

Manual checking is slow and error-prone for large word lists.

Counting words with a prefix using a special structure is fast and reliable.

This technique powers quick search suggestions and autocomplete features.

Practice

1. What does the problem "Count Words with Given Prefix" ask you to do?

easy

A. Count how many words in a list start with a specific prefix

B. Find the longest word in a list

C. Sort words alphabetically

D. Replace the prefix in all words with another string

Solution

1. Step 1: Understand the problem statement

   The problem asks to count words that begin with a given prefix, not to sort or replace words.

2. Step 2: Identify the key action

   Counting words starting with the prefix is the main task.

3. Final Answer:

   Count how many words in a list start with a specific prefix -> Option A

4. Quick Check:

   Count words with prefix = Count how many words in a list start with a specific prefix [OK]

Hint: Focus on words starting with prefix, not other operations [OK]

Common Mistakes:

• Confusing counting with sorting
• Thinking the task is to replace prefixes
• Ignoring the prefix condition

2. Which of the following C# code snippets correctly checks if a string word starts with a prefix prefix?

easy

A. if (word == prefix) { /* do something */ }

B. if (word.Contains(prefix)) { /* do something */ }

C. if (word.EndsWith(prefix)) { /* do something */ }

D. if (word.StartsWith(prefix)) { /* do something */ }

Solution

1. Step 1: Recall string methods in C#

   The method StartsWith checks if a string begins with a given substring.

2. Step 2: Compare options

   Contains checks anywhere in the string, EndsWith checks the end, and == checks exact equality.

3. Final Answer:

   if (word.StartsWith(prefix)) { /* do something */ } -> Option D

4. Quick Check:

   Use StartsWith to check prefix [OK]

Hint: Use StartsWith method to check prefix in C# strings [OK]

Common Mistakes:

• Using Contains instead of StartsWith
• Checking equality instead of prefix
• Using EndsWith which checks suffix

3. What is the output of the following C# code?

string[] words = {"apple", "app", "application", "banana"};
string prefix = "app";
int count = 0;
foreach (var word in words) {
    if (word.StartsWith(prefix)) {
        count++;
    }
}
Console.WriteLine(count);

medium

A. 2

B. 1

C. 3

D. 4

Solution

1. Step 1: Check each word against prefix "app"

   Words: "apple" (yes), "app" (yes), "application" (yes), "banana" (no).

2. Step 2: Count matches

   Three words start with "app", so count = 3.

3. Final Answer:

   3 -> Option C

4. Quick Check:

   Words starting with "app" = 3 [OK]

Hint: Count words starting with prefix by checking each word [OK]

Common Mistakes:

• Counting only exact matches
• Including words that contain prefix but don't start with it
• Off-by-one counting errors

4. The following code is intended to count words starting with a prefix but gives wrong output. What is the error?

string[] words = {"cat", "car", "dog", "cart"};
string prefix = "car";
int count = 0;
for (int i = 0; i <= words.Length; i++) {
    if (words[i].StartsWith(prefix)) {
        count++;
    }
}
Console.WriteLine(count);

medium

A. The loop condition should be i < words.Length instead of <=.

B. The prefix variable is incorrect.

C. The StartsWith method is used wrongly.

D. The count variable should be initialized inside the loop.

Solution

1. Step 1: Analyze the for loop condition

   The loop runs from i = 0 to i <= words.Length, which causes an index out of range error because valid indices are 0 to words.Length - 1.

2. Step 2: Correct the loop condition

   Change condition to i < words.Length to avoid accessing invalid index.

3. Final Answer:

   The loop condition should be i < words.Length instead of <=. -> Option A

4. Quick Check:

   Loop index must be less than array length [OK]

Hint: Use i < array.Length to avoid index errors in loops [OK]

Common Mistakes:

• Using <= instead of < in loop condition
• Reinitializing count inside loop
• Misusing StartsWith method

5. Given a list of words ["tree", "trie", "trigger", "trip", "try", "matrix"] and prefix "tri", which C# code snippet correctly counts the words starting with the prefix and prints the count?

hard

A. int count = 0; foreach(var word in words) { if(word.Contains(prefix)) count++; } Console.WriteLine(count);

B. int count = words.Count(word => word.StartsWith(prefix)); Console.WriteLine(count);

C. int count = 0; for(int i=0; i<=words.Length; i++) { if(words[i].StartsWith(prefix)) count++; } Console.WriteLine(count);

D. int count = words.Length; Console.WriteLine(count);

Solution

1. Step 1: Understand the requirement

   We need to count words starting exactly with prefix "tri".

2. Step 2: Evaluate each option

   int count = words.Count(word => word.StartsWith(prefix)); Console.WriteLine(count); uses LINQ Count with StartsWith correctly.
   int count = 0; foreach(var word in words) { if(word.Contains(prefix)) count++; } Console.WriteLine(count); uses Contains which counts words containing prefix anywhere.
   int count = 0; for(int i=0; i<=words.Length; i++) { if(words[i].StartsWith(prefix)) count++; } Console.WriteLine(count); has loop with <= causing index error.
   int count = words.Length; Console.WriteLine(count); counts all words ignoring prefix.

3. Final Answer:

   int count = words.Count(word => word.StartsWith(prefix)); Console.WriteLine(count); -> Option B

4. Quick Check:

   Use LINQ Count with StartsWith for prefix count [OK]

Hint: Use LINQ Count with StartsWith for concise prefix counting [OK]

Common Mistakes:

• Using Contains instead of StartsWith
• Loop index out of range errors
• Counting all words without prefix check