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.

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

Alphabet cipher #1

Closed
emiln opened this issue Dec 14, 2014 · 1 comment
Closed

Alphabet cipher #1

emiln opened this issue Dec 14, 2014 · 1 comment

Comments

@emiln
Copy link

emiln commented Dec 14, 2014

Hi, @gigasquid, and thanks for the cool project.

When encoding meetmebythetree under key scones, shouldn't the encoding be egsgqwtahuiljgs--that is, the sequence shifted one further? Every time I do it by either hand or computation this is what I end up with. If this is in fact an off-by-one error it's present for the decryption test as well.

@gigasquid
Copy link
Owner

You are absolutely right! I was doing it by hand and had the top alphabet line in the README shifted over by one 😸

I will update the kata. Thanks!

gigasquid pushed a commit that referenced this issue Sep 7, 2015
gigasquid pushed a commit that referenced this issue Nov 14, 2016
Merge latest from gigasquid master
gigasquid pushed a commit that referenced this issue Nov 27, 2016
Catch up with original repo
kennethkalmer added a commit to kennethkalmer/wonderland-clojure-katas that referenced this issue Feb 22, 2017
A brute-force approach that actually builds up strings and uses
simple (.indexOf) and (nth) calls to find the intersections between the inputs.

Also includes a decipher solution :)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants