1.Unequal Elements

A test needs to be prepared on the HackerRank platform with questions from different sets of skills to assess candidates. Given an array, skills, of size n, where skills[i] denotes the skill type of the i-th question, select skills for the questions on the test. The skills should be grouped together as much as possible. The goal is to find the maximum length of a subsequence of skills such that there are no more than k unequal adjacent elements in the subsequence.

Formally, find a subsequence of skills, call it x, of length q such that there are at most k indices where x[i] ≠ x[i+1] for all 0 ≤ i < m.

Function Description

Complete the function FindMaxLength in the editor.

Function Signature:

def FindMaxLength(skills: List[int], k: int) -> int:

Parameters:

• int skills[n]: The different skill types.
• int k: The maximum count of unequal adjacent elements.

Returns:

• int: The maximum value of q.

Example

Input:

skills = [1, 1, 2, 3, 2, 1], k = 2

Output:

5

Explanation:

The longest possible subsequence is x = [1, 1, 2, 2, 1].
There are only two indices where x[1] ≠ x[2] and x[3] ≠ x[4].
Return its length, 5.

Constraints:

• 1 ≤ n ≤ 2 * 10^5
• 1 ≤ k < n
• 1 ≤ skills[i] ≤ 2 * 10^5

---

Vowel Substring

Given a string of lowercase letters in the range a-z, determine the number of substrings that can be created where every letter is a vowel and every vowel is present at least once. The vowels are {a, e, i, o, u}. A substring is a contiguous group of characters in the string.

Example

s = "aeiouaaeiou"

There is a substring to the left that is made of vowels: "aeiou", which is followed by an "n". Since "n" is not a vowel, it cannot be included in this substring, and the substring does not contain all of the vowels.
It is necessary to check every substring. Moving the indices, and this substring "aeiou" does contain all the vowels.
It is followed by "aaeiou", which also satisfies the condition.
Thus, there are four substrings that qualify.

Function Description

Complete the function vowelSubstring in the editor below.

Function Signature:

def vowelSubstring(s: str) -> int:

Parameters:

• s (string): The string to be analyzed.

Returns:

• int: The number of substrings that consist of vowels only {a, e, i, o, u} where every vowel appears at least once.

Constraints:

• 1 ≤ len(s) ≤ 10^5
• s[i] ∈ {a-z} (where s[i] is a lowercase letter)

Sample Input For Custom Testing

Sample Case 0

STDIN     Function
-----     --------
aeioua    → s = "aeioua"

Sample Output

2

Explanation

There are two qualifying substrings:

• "aeiou"
• "eioua"

Sample Case 1

STDIN     Function
-----     --------
aeiouxyz  → s = "aeiouxyz"

Sample Output

1

Explanation

There is only one qualifying substring:

• "aeiou"

---

我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。

We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.