Remove Vowels from a String | Return String with Consonants

Remove Vowels from a String | Return String with Consonants

Remove Vowels from a String | Return String with Consonants

Problem Overview

Given a string of house markings, our task is to remove any vowel (a, e, i, o, u) and return the string with only consonants. This will help the committee easily identify the houses that are not being renovated.

Example:

Input:
"ABEIOU"

Output:
"B"

Explanation: The houses marked with vowels (‘A’, ‘E’, ‘I’, ‘O’, ‘U’) will be removed, and only the consonant ‘B’ will remain.

Approach to Solve the Problem

To solve this problem, we need to:

  1. Define the vowels (a, e, i, o, u).
  2. Traverse the string of house markings.
  3. Remove each vowel from the string.
  4. Construct a new string with the remaining consonants.
  5. Return the new string.

Algorithm Steps

  1. Initialize the Input: Accept a string of house markings.
  2. Identify Vowels: Define the set of vowels: a, e, i, o, u.
  3. Traverse and Filter: Loop through the string, and for each character, check if it is a vowel. If it is not a vowel, add it to the result string.
  4. Return Result: After processing all characters, return the resulting string with only consonants.

Python Code Implementation

python
def remove_vowels(house):
vowels = "aeiouAEIOU" # Including both lowercase and uppercase vowels
result = "" # Initialize an empty string for the result# Traverse through each character in the input string
for char in house:
if char not in vowels: # If the character is not a vowel
result += char # Add it to the result stringreturn result # Return the final string without vowels# Example usage
house_markings = “ABEIOU”
print(remove_vowels(house_markings)) # Outputs: “B”

Explanation of the Code

  1. Input: The input house is a string representing the sequence of house markings.
  2. Vowel Definition: We define the string vowels containing all vowels (both lowercase and uppercase) to ensure that both cases are considered.
  3. Loop and Filter: We loop through each character in the input string and check if it is a vowel. If it is not a vowel, it is added to the result string.
  4. Output: After processing the string, we return the result, which contains only consonants.

Time Complexity

The time complexity of the algorithm is O(n)O(n), where nn is the length of the input string. We perform a constant-time operation (checking membership in the vowels string and appending to the result) for each character.

Example Walkthrough

Example 1:

Input:
"ABEIOU"

  1. Start with the string "ABEIOU".
  2. Process each character:
    • ‘A’ is a vowel, so skip it.
    • ‘B’ is not a vowel, so add it to the result.
    • ‘E’ is a vowel, so skip it.
    • ‘I’ is a vowel, so skip it.
    • ‘O’ is a vowel, so skip it.
    • ‘U’ is a vowel, so skip it.
  3. The final result is "B".

Output:
"B"

Example 2:

Input:
"HOUSE"

  1. Start with the string "HOUSE".
  2. Process each character:
    • ‘H’ is not a vowel, so add it to the result.
    • ‘O’ is a vowel, so skip it.
    • ‘U’ is a vowel, so skip it.
    • ‘S’ is not a vowel, so add it to the result.
    • ‘E’ is a vowel, so skip it.
  3. The final result is "HS".

Output:
"HS"

Conclusion

This simple algorithm removes vowels from a string of house markings to help the committee identify the houses that will not be renovated. The solution is efficient and easy to understand, with a time complexity of O(n)O(n). By utilizing a set of vowels and filtering out the non-vowel characters, we achieve the desired result with minimal effort. Click here to know more our program!