Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Users Search
Help Dashboard Sign In Sign Up
Challenges Q&A Sandbox Meta
Challenges
Posts Tags Edits
Post Challenge

Post History

75%
+4 −0
Challenges Just the vowels please

Given a sequence of letters, output only the vowels. Input A sequence of letters This may be a string or any ordered data structure of characters (provided it is consistent between inputs) Th...

9 answers  ·  posted 2y ago by trichoplax‭  ·  last activity 2y ago by taoh‭

Question code-golf alphabet
#4: Post edited by user avatar trichoplax‭ · 2022-10-09T13:29:10Z (about 2 years ago)
Add example of mixed but consistent input and output formats
  • Given a sequence of letters, output only the vowels.
  • ## Input
  • - A sequence of letters
  • - This may be a string or any ordered data structure of characters (provided it is consistent between inputs)
  • - The letters may contain a mixture of upper and lower case
  • - The characters that count as letters for this challenge are A-Z and a-z, specifically `ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`
  • - The input may be empty (it may have length zero)
  • ## Output
  • - All of the vowels from the input, in the same order, and nothing else
  • - This may be a string or any ordered data structure of characters. It does not need to match the input format (provided it is consistent between inputs)
  • - Vowels that appear more than once in the input must appear the same number of times in the output
  • - If there are no vowels in the input, the output is empty (a sequence of length zero)
  • - The characters that count as vowels for this challenge are `AEIOUaeiou`
  • - Case must be maintained - a vowel that is lower case in the input must be lower case in the output, and a vowel that is upper case in the input must be upper case in the output
  • ## Test cases
  • Test cases are in the format `"input" : "output"`
  • ```text
  • "" : ""
  • "q" : ""
  • "S" : ""
  • "Rhythm" : ""
  • "a" : "a"
  • "art" : "a"
  • "atr" : "a"
  • "rat" : "a"
  • "rta" : "a"
  • "tar" : "a"
  • "tra" : "a"
  • "emu" : "eu"
  • "eum" : "eu"
  • "meu" : "eu"
  • "mue" : "ue"
  • "uem" : "ue"
  • "ume" : "ue"
  • "AaeEIiOouU" : "AaeEIiOouU"
  • "aaaaaaaa" : "aaaaaaaa"
  • "bbbbbbbb" : ""
  • "abababab" : "aaaa"
  • "babababa" : "aaaa"
  • "aLtErNaTe" : "aEae"
  • ```
  • > Explanations are optional, but I'm more likely to upvote answers that have one.
  • Given a sequence of letters, output only the vowels.
  • ## Input
  • - A sequence of letters
  • - This may be a string or any ordered data structure of characters (provided it is consistent between inputs)
  • - The letters may contain a mixture of upper and lower case
  • - The characters that count as letters for this challenge are A-Z and a-z, specifically `ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`
  • - The input may be empty (it may have length zero)
  • ## Output
  • - All of the vowels from the input, in the same order, and nothing else
  • - This may be a string or any ordered data structure of characters. It does not need to match the input format (provided it is consistent between inputs)
  • - For example, you may take input as an array of characters, and output as a string, provided this does not change for different inputs
  • - Vowels that appear more than once in the input must appear the same number of times in the output
  • - If there are no vowels in the input, the output is empty (a sequence of length zero)
  • - The characters that count as vowels for this challenge are `AEIOUaeiou`
  • - Case must be maintained - a vowel that is lower case in the input must be lower case in the output, and a vowel that is upper case in the input must be upper case in the output
  • ## Test cases
  • Test cases are in the format `"input" : "output"`
  • ```text
  • "" : ""
  • "q" : ""
  • "S" : ""
  • "Rhythm" : ""
  • "a" : "a"
  • "art" : "a"
  • "atr" : "a"
  • "rat" : "a"
  • "rta" : "a"
  • "tar" : "a"
  • "tra" : "a"
  • "emu" : "eu"
  • "eum" : "eu"
  • "meu" : "eu"
  • "mue" : "ue"
  • "uem" : "ue"
  • "ume" : "ue"
  • "AaeEIiOouU" : "AaeEIiOouU"
  • "aaaaaaaa" : "aaaaaaaa"
  • "bbbbbbbb" : ""
  • "abababab" : "aaaa"
  • "babababa" : "aaaa"
  • "aLtErNaTe" : "aEae"
  • ```
  • > Explanations are optional, but I'm more likely to upvote answers that have one.
#3: Post edited by user avatar trichoplax‭ · 2022-10-09T13:25:59Z (about 2 years ago)
Require input and output formats to be consistent between inputs
  • Given a sequence of letters, output only the vowels.
  • ## Input
  • - A sequence of letters
  • - This may be a string or any ordered data structure of characters
  • - The letters may contain a mixture of upper and lower case
  • - The characters that count as letters for this challenge are A-Z and a-z, specifically `ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`
  • - The input may be empty (it may have length zero)
  • ## Output
  • - All of the vowels from the input, in the same order, and nothing else
  • - This may be a string or any ordered data structure of characters
  • - Vowels that appear more than once in the input must appear the same number of times in the output
  • - If there are no vowels in the input, the output is empty (a sequence of length zero)
  • - The characters that count as vowels for this challenge are `AEIOUaeiou`
  • - Case must be maintained - a vowel that is lower case in the input must be lower case in the output, and a vowel that is upper case in the input must be upper case in the output
  • ## Test cases
  • Test cases are in the format `"input" : "output"`
  • ```text
  • "" : ""
  • "q" : ""
  • "S" : ""
  • "Rhythm" : ""
  • "a" : "a"
  • "art" : "a"
  • "atr" : "a"
  • "rat" : "a"
  • "rta" : "a"
  • "tar" : "a"
  • "tra" : "a"
  • "emu" : "eu"
  • "eum" : "eu"
  • "meu" : "eu"
  • "mue" : "ue"
  • "uem" : "ue"
  • "ume" : "ue"
  • "AaeEIiOouU" : "AaeEIiOouU"
  • "aaaaaaaa" : "aaaaaaaa"
  • "bbbbbbbb" : ""
  • "abababab" : "aaaa"
  • "babababa" : "aaaa"
  • "aLtErNaTe" : "aEae"
  • ```
  • > Explanations are optional, but I'm more likely to upvote answers that have one.
  • Given a sequence of letters, output only the vowels.
  • ## Input
  • - A sequence of letters
  • - This may be a string or any ordered data structure of characters (provided it is consistent between inputs)
  • - The letters may contain a mixture of upper and lower case
  • - The characters that count as letters for this challenge are A-Z and a-z, specifically `ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`
  • - The input may be empty (it may have length zero)
  • ## Output
  • - All of the vowels from the input, in the same order, and nothing else
  • - This may be a string or any ordered data structure of characters. It does not need to match the input format (provided it is consistent between inputs)
  • - Vowels that appear more than once in the input must appear the same number of times in the output
  • - If there are no vowels in the input, the output is empty (a sequence of length zero)
  • - The characters that count as vowels for this challenge are `AEIOUaeiou`
  • - Case must be maintained - a vowel that is lower case in the input must be lower case in the output, and a vowel that is upper case in the input must be upper case in the output
  • ## Test cases
  • Test cases are in the format `"input" : "output"`
  • ```text
  • "" : ""
  • "q" : ""
  • "S" : ""
  • "Rhythm" : ""
  • "a" : "a"
  • "art" : "a"
  • "atr" : "a"
  • "rat" : "a"
  • "rta" : "a"
  • "tar" : "a"
  • "tra" : "a"
  • "emu" : "eu"
  • "eum" : "eu"
  • "meu" : "eu"
  • "mue" : "ue"
  • "uem" : "ue"
  • "ume" : "ue"
  • "AaeEIiOouU" : "AaeEIiOouU"
  • "aaaaaaaa" : "aaaaaaaa"
  • "bbbbbbbb" : ""
  • "abababab" : "aaaa"
  • "babababa" : "aaaa"
  • "aLtErNaTe" : "aEae"
  • ```
  • > Explanations are optional, but I'm more likely to upvote answers that have one.
#2: Post edited by user avatar trichoplax‭ · 2022-10-08T05:28:18Z (about 2 years ago)
Explicitly allow non-string output sequences
  • Given a sequence of letters, output only the vowels.
  • ## Input
  • - A sequence of letters
  • - This may be a string or any ordered data structure of characters
  • - The letters may contain a mixture of upper and lower case
  • - The characters that count as letters for this challenge are A-Z and a-z, specifically `ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`
  • - The input may be empty (it may have length zero)
  • ## Output
  • - All of the vowels from the input, in the same order, and nothing else
  • - Vowels that appear more than once in the input must appear the same number of times in the output
  • - If there are no vowels in the input, the output is empty (a sequence of length zero)
  • - The characters that count as vowels for this challenge are `AEIOUaeiou`
  • - Case must be maintained - a vowel that is lower case in the input must be lower case in the output, and a vowel that is upper case in the input must be upper case in the output
  • ## Test cases
  • Test cases are in the format `"input" : "output"`
  • ```text
  • "" : ""
  • "q" : ""
  • "S" : ""
  • "Rhythm" : ""
  • "a" : "a"
  • "art" : "a"
  • "atr" : "a"
  • "rat" : "a"
  • "rta" : "a"
  • "tar" : "a"
  • "tra" : "a"
  • "emu" : "eu"
  • "eum" : "eu"
  • "meu" : "eu"
  • "mue" : "ue"
  • "uem" : "ue"
  • "ume" : "ue"
  • "AaeEIiOouU" : "AaeEIiOouU"
  • "aaaaaaaa" : "aaaaaaaa"
  • "bbbbbbbb" : ""
  • "abababab" : "aaaa"
  • "babababa" : "aaaa"
  • "aLtErNaTe" : "aEae"
  • ```
  • > Explanations are optional, but I'm more likely to upvote answers that have one.
  • Given a sequence of letters, output only the vowels.
  • ## Input
  • - A sequence of letters
  • - This may be a string or any ordered data structure of characters
  • - The letters may contain a mixture of upper and lower case
  • - The characters that count as letters for this challenge are A-Z and a-z, specifically `ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`
  • - The input may be empty (it may have length zero)
  • ## Output
  • - All of the vowels from the input, in the same order, and nothing else
  • - This may be a string or any ordered data structure of characters
  • - Vowels that appear more than once in the input must appear the same number of times in the output
  • - If there are no vowels in the input, the output is empty (a sequence of length zero)
  • - The characters that count as vowels for this challenge are `AEIOUaeiou`
  • - Case must be maintained - a vowel that is lower case in the input must be lower case in the output, and a vowel that is upper case in the input must be upper case in the output
  • ## Test cases
  • Test cases are in the format `"input" : "output"`
  • ```text
  • "" : ""
  • "q" : ""
  • "S" : ""
  • "Rhythm" : ""
  • "a" : "a"
  • "art" : "a"
  • "atr" : "a"
  • "rat" : "a"
  • "rta" : "a"
  • "tar" : "a"
  • "tra" : "a"
  • "emu" : "eu"
  • "eum" : "eu"
  • "meu" : "eu"
  • "mue" : "ue"
  • "uem" : "ue"
  • "ume" : "ue"
  • "AaeEIiOouU" : "AaeEIiOouU"
  • "aaaaaaaa" : "aaaaaaaa"
  • "bbbbbbbb" : ""
  • "abababab" : "aaaa"
  • "babababa" : "aaaa"
  • "aLtErNaTe" : "aEae"
  • ```
  • > Explanations are optional, but I'm more likely to upvote answers that have one.
#1: Initial revision by user avatar trichoplax‭ · 2022-10-08T00:34:10Z (about 2 years ago) 
Just the vowels please
Given a sequence of letters, output only the vowels.

## Input
- A sequence of letters
- This may be a string or any ordered data structure of characters
- The letters may contain a mixture of upper and lower case
- The characters that count as letters for this challenge are A-Z and a-z, specifically `ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`
- The input may be empty (it may have length zero)

## Output
- All of the vowels from the input, in the same order, and nothing else
- Vowels that appear more than once in the input must appear the same number of times in the output
- If there are no vowels in the input, the output is empty (a sequence of length zero)
- The characters that count as vowels for this challenge are `AEIOUaeiou`
- Case must be maintained - a vowel that is lower case in the input must be lower case in the output, and a vowel that is upper case in the input must be upper case in the output

## Test cases
Test cases are in the format `"input" : "output"`

```text
"" : ""
"q" : ""
"S" : ""
"Rhythm" : ""
"a" : "a"
"art" : "a"
"atr" : "a"
"rat" : "a"
"rta" : "a"
"tar" : "a"
"tra" : "a"
"emu" : "eu"
"eum" : "eu"
"meu" : "eu"
"mue" : "ue"
"uem" : "ue"
"ume" : "ue"
"AaeEIiOouU" : "AaeEIiOouU"
"aaaaaaaa" : "aaaaaaaa"
"bbbbbbbb" : ""
"abababab" : "aaaa"
"babababa" : "aaaa"
"aLtErNaTe" : "aEae"
```

> Explanations are optional, but I'm more likely to upvote answers that have one.
code-golf alphabet