Instructions

Anagram

Input: odce
Output: code, coed

Ascii

Input: 97 98 99
Output: abc

Morse

Input: ... --- ...
Output: sos

Sempahore

Input: W,SW NW,SW
Output: hi

NumericLetter

Input: 1 2 3
Output: abc

PartialPhrase

Input: solv..his
Output: solvethis
Handles up to three words or 300 results.

Regex

Input: r:^f.+zz$
Output: fizz, fuzz

Prefix: r:

T9

Input: 548 853
Output: little

SingleLetter

Input: s
Output: Numeric: 19, Ascii: 115

RemoveLetters

Input: hxexlxlxo - xxxx
Output: hello

Alphabear

Input: a:aa,ttz
Output: tata
First group of letters is the set of required letters.

Prefix: a:

Caesar

Input: sgd pthbj
Output: the quick

Hex

Input: a3
Output: 1010 0011

Binary

Input: 1010 0011
Output: a3

Base64

Input: Y29kZQ==
Output: code

LooseAnagram

Input: la:code,code,code
Output: cod, doc

Prefix: la:

Subword

Input: odce[,length]
Output: doe, eco, do

Prefix: subword:

InOrderSubword

Input: doce[,length]
Output: do, doe

Prefix: iosubword:

MultiwordAnagram

Input: odce[,length1[,lengthN]]
Output: code, coed

Prefix: anagram:

Contains

Input: c:codeafew
Output: henceforward, thenceforward

Prefix: c:

StrictContains

Input: sc:code
Output: codded, decode, coed

Prefix: sc:

IATA

Input: iata:AKL
Output: weakly

Prefix: iata:

Numeric Letters