Here is a Python solution for the problem:

```python
def longest_substring_without_vowel(T, strings):
vowels = 'aeiou'
results = []
for i in range(T):
S = strings[i]
max_length = 0
current_length = 0
for char in S:
if char not in vowels:
current_length += 1
if current_length max_length:
max_length = current_length
else:
current_length = 0
results.append(max_length)
return results
```

This function takes two arguments: `T` which is the number of test cases and `strings` which is a list of strings. For each string, it iterates over each character. If the character is not a vowel, it increments the current length of the substring without vowels. If this length is greater than the maximum length found so far, it updates the maximum length. If the character is a vowel, it resets the current length to 0. Finally, it returns a list of the maximum lengths for each string.

Here is how you can use this function:

```python
T = 2
strings = ['abcde', 'fghij']
print(longest_substring_without_vowel(T, strings))
```

This will output `[1, 5]` because the longest substring without vowels in 'abcde' is 'b' with length 1 and in 'fghij' is 'fghij' with length 5.

Question

Here is a Python solution for the problem:

```python
def longest_substring_without_vowel(T, strings):
    vowels = 'aeiou'
    results = []
    for i in range(T):
        S = strings[i]
        max_length = 0
        current_length = 0
        for char in S:
            if char not in vowels:
                current_length += 1
                if current_length > max_length:
                    max_length = current_length
            else:
                current_length = 0
        results.append(max_length)
    return results
```

This function takes two arguments: `T` which is the number of test cases and `strings` which is a list of strings. For each string, it iterates over each character. If the character is not a vowel, it increments the current length of the substring without vowels. If this length is greater than the maximum length found so far, it updates the maximum length. If the character is a vowel, it resets the current length to 0. Finally, it returns a list of the maximum lengths for each string.

Here is how you can use this function:

```python
T = 2
strings = ['abcde', 'fghij']
print(longest_substring_without_vowel(T, strings))
```

This will output `[1, 5]` because the longest substring without vowels in 'abcde' is 'b' with length 1 and in 'fghij' is 'fghij' with length 5.

Knowee AI · Accepted Answer

Here is a Python solution for the problem:

```python
def longest_substring_without_vowel(T, strings):
    vowels = 'aeiou'
    results = []
    for i in range(T):
        S = strings[i]
        max_length = 0
        current_length = 0
        for char in S:
            if char not in vowels:
                current_length += 1
                if current_length > max_length:
                    max_length = current_length
            else:
                current_length = 0
        results.append(max_length)
    return results
```

This function takes two arguments: `T` which is the number of test cases and `strings` which is a list of strings. For each string, it iterates over each character. If the character is not a vowel, it increments the current length of the substring without vowels. If this length is greater than the maximum length found so far, it updates the maximum length. If the character is a vowel, it resets the current length to 0. Finally, it returns a list of the maximum lengths for each string.

Here is how you can use this function:

```python
T = 2
strings = ['abcde', 'fghij']
print(longest_substring_without_vowel(T, strings))
```

This will output `[1, 5]` because the longest substring without vowels in 'abcde' is 'b' with length 1 and in 'fghij' is 'fghij' with length 5.

Question

Solution

Similar Questions

Upgrade your grade with Knowee