If given a letter from the set:
[abc...xyz]
and a shift, implement a shift cypher.
Example:
'abc'
with a shift of -1 yields
'zab'
outStr=char(mod(inStr+shift-97,26)+97);
hi
Covered negative shift this time
very straight forward solution that passes test suite but does not handle example in description correctly.
hello, what if shift >= 52 or shift < 0?
Does this work for negative shifts?
This is a sneaky way to get around the prohibition against using eval!
6249 Solvers
Project Euler: Problem 5, Smallest multiple
210 Solvers
163 Solvers
Find Index of maximum Value and maximum Value of a vector
117 Solvers
184 Solvers