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!
Return the 3n+1 sequence for n
4919 Solvers
14198 Solvers
middleAsColumn: Return all but first and last element as a column vector
287 Solvers
Matrix with different incremental runs
175 Solvers
183 Solvers