Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -170,6 +170,14 @@
"prerequisites": [],
"difficulty": 2
},
{
"slug": "rotational-cipher",
"name": "Rotational Cipher",
"uuid": "365fb81f-c059-4231-954b-bac1878e2a0c",
"practices": [],
"prerequisites": [],
"difficulty": 3
},
{
"slug": "rna-transcription",
"name": "RNA Transcription",
Expand Down
5 changes: 5 additions & 0 deletions exercises/practice/rotational-cipher/.busted
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
return {
default = {
ROOT = { '.' }
}
}
29 changes: 29 additions & 0 deletions exercises/practice/rotational-cipher/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
# Instructions

Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.

The Caesar cipher is a simple shift cipher that relies on transposing all the letters in the alphabet using an integer key between `0` and `26`.
Using a key of `0` or `26` will always yield the same output due to modular arithmetic.
The letter is shifted for as many values as the value of the key.

The general notation for rotational ciphers is `ROT + <key>`.
The most commonly used rotational cipher is `ROT13`.

A `ROT13` on the Latin alphabet would be as follows:

```text
Plain: abcdefghijklmnopqrstuvwxyz
Cipher: nopqrstuvwxyzabcdefghijklm
```

It is stronger than the Atbash cipher because it has 27 possible keys, and 25 usable keys.

Ciphertext is written out in the same formatting as the input including spaces and punctuation.

## Examples

- ROT5 `omg` gives `trl`
- ROT0 `c` gives `c`
- ROT26 `Cool` gives `Cool`
- ROT13 `The quick brown fox jumps over the lazy dog.` gives `Gur dhvpx oebja sbk whzcf bire gur ynml qbt.`
- ROT13 `Gur dhvpx oebja sbk whzcf bire gur ynml qbt.` gives `The quick brown fox jumps over the lazy dog.`
19 changes: 19 additions & 0 deletions exercises/practice/rotational-cipher/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
{
"authors": [
"BNAndras"
],
"files": {
"solution": [
"rotational_cipher.moon"
],
"test": [
"rotational_cipher_spec.moon"
],
"example": [
".meta/example.moon"
]
},
"blurb": "Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.",
"source": "Wikipedia",
"source_url": "https://en.wikipedia.org/wiki/Caesar_cipher"
}
11 changes: 11 additions & 0 deletions exercises/practice/rotational-cipher/.meta/example.moon
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
{
rotate: (text, shift_key) ->
text\gsub '.', (char) ->
byte = string.byte char
if byte >= 97 and byte <= 122
string.char (byte - 97 + shift_key) % 26 + 97
elseif byte >= 65 and byte <= 90
string.char (byte - 65 + shift_key) % 26 + 65
else
char
}
11 changes: 11 additions & 0 deletions exercises/practice/rotational-cipher/.meta/spec_generator.moon
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
{
module_name: 'RotationalCipher',

generate_test: (case, level) ->
lines = {
"result = RotationalCipher.rotate #{quote case.input.text}, #{case.input.shiftKey}",
"expected = #{quote case.expected}",
"assert.are.equal expected, result"
}
table.concat [indent line, level for line in *lines], '\n'
}
40 changes: 40 additions & 0 deletions exercises/practice/rotational-cipher/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
# 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.

[74e58a38-e484-43f1-9466-877a7515e10f]
description = "rotate a by 0, same output as input"

[7ee352c6-e6b0-4930-b903-d09943ecb8f5]
description = "rotate a by 1"

[edf0a733-4231-4594-a5ee-46a4009ad764]
description = "rotate a by 26, same output as input"

[e3e82cb9-2a5b-403f-9931-e43213879300]
description = "rotate m by 13"

[19f9eb78-e2ad-4da4-8fe3-9291d47c1709]
description = "rotate n by 13 with wrap around alphabet"

[a116aef4-225b-4da9-884f-e8023ca6408a]
description = "rotate capital letters"

[71b541bb-819c-4dc6-a9c3-132ef9bb737b]
description = "rotate spaces"

[ef32601d-e9ef-4b29-b2b5-8971392282e6]
description = "rotate numbers"

[32dd74f6-db2b-41a6-b02c-82eb4f93e549]
description = "rotate punctuation"

[9fb93fe6-42b0-46e6-9ec1-0bf0a062d8c9]
description = "rotate all letters"
4 changes: 4 additions & 0 deletions exercises/practice/rotational-cipher/rotational_cipher.moon
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
{
rotate: (text, shift_key) ->
error 'Implement me'
}
52 changes: 52 additions & 0 deletions exercises/practice/rotational-cipher/rotational_cipher_spec.moon
Original file line number Diff line number Diff line change
@@ -0,0 +1,52 @@
RotationalCipher = require 'rotational_cipher'

describe 'rotational-cipher', ->
it 'rotate a by 0, same output as input', ->
result = RotationalCipher.rotate 'a', 0
expected = 'a'
assert.are.equal expected, result

pending 'rotate a by 1', ->
result = RotationalCipher.rotate 'a', 1
expected = 'b'
assert.are.equal expected, result

pending 'rotate a by 26, same output as input', ->
result = RotationalCipher.rotate 'a', 26
expected = 'a'
assert.are.equal expected, result

pending 'rotate m by 13', ->
result = RotationalCipher.rotate 'm', 13
expected = 'z'
assert.are.equal expected, result

pending 'rotate n by 13 with wrap around alphabet', ->
result = RotationalCipher.rotate 'n', 13
expected = 'a'
assert.are.equal expected, result

pending 'rotate capital letters', ->
result = RotationalCipher.rotate 'OMG', 5
expected = 'TRL'
assert.are.equal expected, result

pending 'rotate spaces', ->
result = RotationalCipher.rotate 'O M G', 5
expected = 'T R L'
assert.are.equal expected, result

pending 'rotate numbers', ->
result = RotationalCipher.rotate 'Testing 1 2 3 testing', 4
expected = 'Xiwxmrk 1 2 3 xiwxmrk'
assert.are.equal expected, result

pending 'rotate punctuation', ->
result = RotationalCipher.rotate "Let's eat, Grandma!", 21
expected = "Gzo'n zvo, Bmviyhv!"
assert.are.equal expected, result

pending 'rotate all letters', ->
result = RotationalCipher.rotate 'The quick brown fox jumps over the lazy dog.', 13
expected = 'Gur dhvpx oebja sbk whzcf bire gur ynml qbt.'
assert.are.equal expected, result
Loading