Code Golf

#8: Post edited by

trichoplax‭ · 2022-10-30T16:53:16Z (over 1 year ago)
Mark as finalized

Copy Link

Raw

Markdown

~~Sort letters by height~~

Sort letters by height [FINALIZED]

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
acemnorsuvwxz
t
i
bdfghklpqy
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
"a" : ["a"]
"aa" : ["aa"]
"atibj" : ["atibj", "jbita"]
"tick" : ["ctik", "kitc"]
"now" : ["now", "nwo", "onw", "own", "wno", "won"]
"just" : ["jtus", "jtsu", "sutj", "ustj"]
"pjztyix" : ["xztipyj", "zxtipyj", "xztiypj", "zxtiypj", "jypitzx", "jypitxz", "jpyitzx", "jpyitxz"]
```

# Now posted: [Sort letters by height](https://codegolf.codidact.com/posts/287324)
---
Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
acemnorsuvwxz
t
i
bdfghklpqy
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
"a" : ["a"]
"aa" : ["aa"]
"atibj" : ["atibj", "jbita"]
"tick" : ["ctik", "kitc"]
"now" : ["now", "nwo", "onw", "own", "wno", "won"]
"just" : ["jtus", "jtsu", "sutj", "ustj"]
"pjztyix" : ["xztipyj", "zxtipyj", "xztiypj", "zxtiypj", "jypitzx", "jypitxz", "jpyitzx", "jpyitxz"]
```

code-golf string alphabet

code-golf string finalized alphabet

#7: Post edited by

trichoplax‭ · 2022-10-30T16:47:14Z (over 1 year ago)
Add test case

Copy Link

Raw

Markdown

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
acemnorsuvwxz
t
i
bdfghklpqy
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
"a" : ["a"]
"aa" : ["aa"]
"atibj" : ["atibj", "jbita"]
"tick" : ["ctik", "kitc"]
"now" : ["now", "nwo", "onw", "own", "wno", "won"]
"just" : ["jtus", "jtsu", "sutj", "ustj"]
```

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
acemnorsuvwxz
t
i
bdfghklpqy
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
"a" : ["a"]
"aa" : ["aa"]
"atibj" : ["atibj", "jbita"]
"tick" : ["ctik", "kitc"]
"now" : ["now", "nwo", "onw", "own", "wno", "won"]
"just" : ["jtus", "jtsu", "sutj", "ustj"]
"pjztyix" : ["xztipyj", "zxtipyj", "xztiypj", "zxtiypj", "jypitzx", "jypitxz", "jpyitzx", "jpyitxz"]
```

#6: Post edited by

trichoplax‭ · 2022-10-30T15:45:50Z (over 1 year ago)
Add test cases

Copy Link

Raw

Markdown

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
acemnorsuvwxz
t
i
bdfghklpqy
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
~~TODO: test cases~~
```

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
acemnorsuvwxz
t
i
bdfghklpqy
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
"a" : ["a"]
"aa" : ["aa"]
"atibj" : ["atibj", "jbita"]
"tick" : ["ctik", "kitc"]
"now" : ["now", "nwo", "onw", "own", "wno", "won"]
"just" : ["jtus", "jtsu", "sutj", "ustj"]
```

#5: Post edited by

trichoplax‭ · 2022-10-30T15:35:04Z (over 1 year ago)
List same height letters in alphabetical order

Copy Link

Raw

Markdown

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
~~aceozxnmruwsv~~
t
i
yqpdfghklb
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
TODO: test cases
```

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
acemnorsuvwxz
t
i
bdfghklpqy
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
TODO: test cases
```

#4: Post edited by

trichoplax‭ · 2022-10-30T14:20:16Z (over 1 year ago)
Allow different formats for input and output

Copy Link

Raw

Markdown

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
aceozxnmruwsv
t
i
yqpdfghklb
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
~~- This may be a string or any ordered data structure of characters.~~
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
TODO: test cases
```

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
aceozxnmruwsv
t
i
yqpdfghklb
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- 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 format does not change for different inputs
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
TODO: test cases
```

#3: Post edited by

trichoplax‭ · 2022-10-30T14:13:47Z (over 1 year ago)
Fix test case format

Copy Link

Raw

Markdown

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
aceozxnmruwsv
t
i
yqpdfghklb
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- This may be a string or any ordered data structure of characters.
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `input : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
TODO: test cases
```

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
aceozxnmruwsv
t
i
yqpdfghklb
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- This may be a string or any ordered data structure of characters.
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `"input" : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
TODO: test cases
```

#2: Post edited by

trichoplax‭ · 2022-10-30T14:06:51Z (over 1 year ago)
Modify sort order and clarify output

Copy Link

Raw

Markdown

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
aceozxnmruwsv
it
yqpdfghklb
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- This may be a string or any ordered data structure of characters.
~~- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input)~~
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `input : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
TODO: test cases
```

Given a sequence of lower case letters, sort them into order of height.
## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:
```text
aceozxnmruwsv
t
i
yqpdfghklb
j
```
Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.
## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters
## Output
- A sequence of the same letters in sorted order
- This may be a string or any ordered data structure of characters.
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input, even if the input was already sorted)
- The sort may be either ascending or descending
## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `input : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.
```text
TODO: test cases
```

#1: Initial revision by

trichoplax‭ · 2022-10-30T13:59:36Z (over 1 year ago)

Copy Link

Raw

Markdown

Sort letters by height

Given a sequence of lower case letters, sort them into order of height.


## Heights
The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below:

```text
aceozxnmruwsv
it
yqpdfghklb
j
```

Letters on the same line are defined to be the same height. The first line is the shortest letters, the last line is the tallest letter.

## Input
- A sequence of lower case letters
- This may be a string or any data structure of characters

## Output
- A sequence of the same letters in sorted order
- This may be a string or any ordered data structure of characters.
- The sort does not need to be stable (letters that are the same height do not need to remain in the same order as the input)
- The sort may be either ascending or descending

## Test cases
Since the sort order can be either ascending or descending, and the sort does not need to be stable, most inputs will have many possible valid outputs. The test cases are in the format `input : ["valid", "outputs"]`. You may choose any of the valid outputs, but you must output only one of them.

```text




TODO: test cases




```

code-golf string alphabet

Communities

Post History