I Haz Codes

Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Menu
The super merge cipher!

Shhh. They are listening! We need a plan…

I know, let us use a cipher to hide our conversations. That way they will not understand what we say.

The cipher works like this. You take a sentence and split it into two lists. One has the even words, the other the odd words. All punctuation is ignored.

So for example


"Hello world! I am pleased to meet you!"

odd = [“Hello”, “I” ,”pleased” ,”meet”]
even = [“world”, “am”, “to”, “you”]

You then combine the two lists using these rules –

  • Take the last word of each list.
  • Take the last letter of each word and place them next to each other. One from each word (starting with odd)
  • Repeat until one word is out of letters.
  • Place a “!” symbol if it belonged to the odd word or a “#” if it belonged to the even and then copy the rest of the letters.
  • Place a space in the output
  • Repeat until one list is empty
  • Finally copy the last word (if any) over to the output.

So the result of these rules would be –


"Hello world! I am pleased to meet you!"

odd = [“Hello”, “I” ,”pleased” ,”meet”]
even = [“world”, “am”, “to”, “you”]
output = “tueoey!m doet!saelp im#a odlllreohw”

You are to write two functions. One which will encrypt a sentence and one which will decrypt one. This is a hard problem! Make sure you can decipher the text before you begin the code.
You need to log in or create an account to submit code!

Leave a Reply

Your email address will not be published. Required fields are marked *

Information