Rotational Cipher

Challenge Overview

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

Visit the rotational-cipher exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

View Community Solutions

The following are the top 3 community solutions by stars:

Solution 1 by @WladimirTavares (⭐ 1) — View on Exercism
Solution 2 by @nobsun (⭐ 0) — View on Exercism
Solution 3 by @robotsnowfall (⭐ 0) — View on Exercism

Source: Exercism haskell/rotational-cipher

💡 View Solution

module RotationalCipher (rotate) where

import Data.Char

cipherLower x n = chr ( ord 'a' + mod (ord x - ord 'a' + n) 26)
cipherUpper x n = chr ( ord 'A' + mod (ord x - ord 'A' + n) 26)

rotate :: Int -> String -> String
rotate n [] = []
rotate n (x:xs)