Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[New Exercise]: Diamond #245

Merged
merged 1 commit into from
Aug 13, 2023
Merged

[New Exercise]: Diamond #245

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
8 changes: 8 additions & 0 deletions config.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -437,6 +437,14 @@
"prerequisites": [],
"difficulty": 2
},
{
"slug": "diamond",
"name": "Diamond",
"uuid": "2ff69e4a-e939-483e-95da-11c01b2b983b",
"practices": [],
"prerequisites": [],
"difficulty": 2
},
{
"slug": "matrix",
"name": "Matrix",
Expand Down
52 changes: 52 additions & 0 deletions exercises/practice/diamond/.docs/instructions.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,52 @@
# Instructions

The diamond kata takes as its input a letter, and outputs it in a diamond shape.
Given a letter, it prints a diamond starting with 'A', with the supplied letter at the widest point.

## Requirements

- The first row contains one 'A'.
- The last row contains one 'A'.
- All rows, except the first and last, have exactly two identical letters.
- All rows have as many trailing spaces as leading spaces. (This might be 0).
- The diamond is horizontally symmetric.
- The diamond is vertically symmetric.
- The diamond has a square shape (width equals height).
- The letters form a diamond shape.
- The top half has the letters in ascending order.
- The bottom half has the letters in descending order.
- The four corners (containing the spaces) are triangles.

## Examples

In the following examples, spaces are indicated by `·` characters.

Diamond for letter 'A':

```text
A
```

Diamond for letter 'C':

```text
··A··
·B·B·
C···C
·B·B·
··A··
```

Diamond for letter 'E':

```text
····A····
···B·B···
··C···C··
·D·····D·
E·······E
·D·····D·
··C···C··
···B·B···
····A····
```
48 changes: 48 additions & 0 deletions exercises/practice/diamond/.meta/Diamond.example.ps1
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@
Function Invoke-Diamond() {
<#
.SYNOPSIS
Given a letter, output a diamond shape.

.DESCRIPTION
Take a letter of the alphabet, return a string in a diamond shape starting with 'A', with the supplied letter at the widest point.
The output should use only capitalized letters, however the input should be case-insensitive.

.PARAMETER Letter
The letter used to decide the shape of the diamond.

.EXAMPLE
Invoke-Diamond -Letter D
Return:
@"
A
B B
C C
D D
C C
B B
A
"@
#>
[CmdletBinding()]
Param(
[char]$Letter
)
$Letter = $Letter.ToString().ToUpper()

if ($Letter -eq 'A') {
return "A`n"
}

$MakeLine = { param($l)
$space = ' ' * ([char]$Letter - [char]$l)
if ($l -eq 'A') {
return "${space}${l}${space}"
} else {
$mid = ' ' * (([char]$l - [char]'A') * 2 - 1)
return "${space}${l}${mid}${l}${space}"
}
}

$Diamond = [char]'A'..[char]$Letter + [char]($Letter-1)..[char]'A' | ForEach-Object {& $MakeLine $_}
return $Diamond -join "`r`n"
}
17 changes: 17 additions & 0 deletions exercises/practice/diamond/.meta/config.json
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
{
"authors": ["glaxxie"],
"files": {
"solution": [
"Diamond.ps1"
],
"test": [
"Diamond.tests.ps1"
],
"example": [
".meta/Diamond.example.ps1"
]
},
"blurb": "Given a letter, print a diamond starting with 'A' with the supplied letter at the widest point.",
"source": "Seb Rose",
"source_url": "https://web.archive.org/web/20220807163751/http://claysnow.co.uk/recycling-tests-in-tdd/"
}
25 changes: 25 additions & 0 deletions exercises/practice/diamond/.meta/tests.toml
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
# This is an auto-generated file.
#
# Regenerating this file via `configlet sync` will:
# - Recreate every `description` key/value pair
# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
# - Preserve any other key/value pair
#
# As user-added comments (using the # character) will be removed when this file
# is regenerated, comments can be added via a `comment` key.

[202fb4cc-6a38-4883-9193-a29d5cb92076]
description = "Degenerate case with a single 'A' row"

[bd6a6d78-9302-42e9-8f60-ac1461e9abae]
description = "Degenerate case with no row containing 3 distinct groups of spaces"

[af8efb49-14ed-447f-8944-4cc59ce3fd76]
description = "Smallest non-degenerate case with odd diamond side length"

[e0c19a95-9888-4d05-86a0-fa81b9e70d1d]
description = "Smallest non-degenerate case with even diamond side length"

[82ea9aa9-4c0e-442a-b07e-40204e925944]
description = "Largest possible diamond"
31 changes: 31 additions & 0 deletions exercises/practice/diamond/Diamond.ps1
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
Function Invoke-Diamond() {
<#
.SYNOPSIS
Given a letter, output a diamond shape.

.DESCRIPTION
Take a letter of the alphabet, return a string in a diamond shape starting with 'A', with the supplied letter at the widest point.
The output should use only capitalized letters, however the input should be case-insensitive.

.PARAMETER Letter
The letter used to decide the shape of the diamond.

.EXAMPLE
Invoke-Diamond -Letter D
Return:
@"
A
B B
C C
D D
C C
B B
A
"@
#>
[CmdletBinding()]
Param(
[char]$Letter
)
Throw "Please implement this function"
}
111 changes: 111 additions & 0 deletions exercises/practice/diamond/Diamond.tests.ps1
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,111 @@
BeforeAll {
. "./Diamond.ps1"
}

Describe "Diamond test cases" {
It "single 'A' row" {
$got = Invoke-Diamond -Letter 'A'
$want = "A`n"

$got | Should -BeExactly $want
}

It "no row containing 3 distinct groups of spaces" {
$got = Invoke-Diamond -Letter 'B'
$want = (" A ",
"B B",
" A ") -join "`r`n"

$got | Should -BeExactly $want
}

It "no row containing 3 distinct groups of spaces case-insensitive" {
$got = Invoke-Diamond -Letter 'b'
$want = (" A ",
"B B",
" A ") -join "`r`n"

$got | Should -BeExactly $want
}

It "odd diamond side length" {
$got = Invoke-Diamond -Letter 'C'
$want = (" A ",
" B B ",
"C C",
" B B ",
" A ") -join "`r`n"

$got | Should -BeExactly $want
}

It "even diamond side length" {
$got = Invoke-Diamond -Letter 'D'
$want = ( " A ",
" B B ",
" C C ",
"D D",
" C C ",
" B B ",
" A ") -join "`r`n"

$got | Should -BeExactly $want
}

It "largest possible diamond" {
$got = Invoke-Diamond -Letter 'Z'
$want = ( " A ",
" B B ",
" C C ",
" D D ",
" E E ",
" F F ",
" G G ",
" H H ",
" I I ",
" J J ",
" K K ",
" L L ",
" M M ",
" N N ",
" O O ",
" P P ",
" Q Q ",
" R R ",
" S S ",
" T T ",
" U U ",
" V V ",
" W W ",
" X X ",
" Y Y ",
"Z Z",
" Y Y ",
" X X ",
" W W ",
" V V ",
" U U ",
" T T ",
" S S ",
" R R ",
" Q Q ",
" P P ",
" O O ",
" N N ",
" M M ",
" L L ",
" K K ",
" J J ",
" I I ",
" H H ",
" G G ",
" F F ",
" E E ",
" D D ",
" C C ",
" B B ",
" A ") -join "`r`n"

$got | Should -BeExactly $want
}
}