समस्या
A reading tutor app highlights vowels. For each of the five vowels a, e, i, o and u, find every index where it appears in the text. Uppercase and lowercase count as the same vowel, and y is not a vowel here. Indexes start at 0 and count every character, including spaces and punctuation.
Implement vowel_positions(text).
Input
text: The text to scan.
Output
Return five lists in the order a, e, i, o, u. Each list holds that vowel's indexes in increasing order and is empty if the vowel does not appear.
सीमाएँ
0 ≤ length of text ≤ 10,000
उदाहरण
इनपुट:
text = "Hello World"
अपेक्षित आउटपुट:
expected = [
[],
[1],
[],
[4, 7],
[]
]
इनपुट:
std::string text = "Hello World";
अपेक्षित आउटपुट:
std::vector<std::vector<long long>> expected = {
{},
{1},
{},
{4, 7},
{}
};
इनपुट:
string text = "Hello World";
अपेक्षित आउटपुट:
long[][] expected = new long[][] {
new long[] {},
new long[] {1},
new long[] {},
new long[] {4, 7},
new long[] {}
};
व्याख्या
e is at index 1 and o at 4 and 7; there is no a, i or u: [[], [1], [], [4, 7], []].
इनपुट:
text = "AU audio"
अपेक्षित आउटपुट:
expected = [
[0, 3],
[],
[6],
[7],
[1, 4]
]
इनपुट:
std::string text = "AU audio";
अपेक्षित आउटपुट:
std::vector<std::vector<long long>> expected = {
{0, 3},
{},
{6},
{7},
{1, 4}
};
इनपुट:
string text = "AU audio";
अपेक्षित आउटपुट:
long[][] expected = new long[][] {
new long[] {0, 3},
new long[] {},
new long[] {6},
new long[] {7},
new long[] {1, 4}
};
व्याख्या
Uppercase counts too: a at 0 and 3, u at 1 and 4, i at 6, o at 7: [[0, 3], [], [6], [7], [1, 4]].
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Make five empty lists before scanning.
संकेत 2
Lowercase each character before you compare it.
संकेत 3
One pass over the text is enough: drop each index into the right list.
अपेक्षित जटिलता
O(n) time, O(n) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।