param($n)-join(65..90|%{"$([char]$_)"*(($_-64)%$n)}) 
3
(Note: this is an easier spin-off of my previous challenge Find the Infinity Words!, which is a spin-off of my other previous challenge Find the Swirling Words! :) )
Definition of a Wavy Word:
If you connect with curves all the characters of a Wavy Word on the alphabet (A-Z) you obtain the pat...
Chained Binary Operations
Here's a challenge involving truth tables and binary operations. For this specific challenge, your task is to use the following table of operations:
To create a function that takes in two inputs f(p,a), where p is the initial truthy/falsy value and a is a list of tup...
Given a string that contains lowercase letters, encode that string with the alphabet cipher.
To encode with the alphabet cipher (I will be using the example hello):
First, convert each letter in the string to a number depending on its position in the alphabet (a = 1, b = 2, etc.) 8 5 12 12 15
...
xkcd is everyone's favorite webcomic, and you will be writing a program that will bring a little bit more humor to us all.
Your objective in this challenge is to write a program which will take a number as input and display that xkcd and its title-text (mousover text).
Input
Your program will ...
How come some golfing languages like Jelly or 05AB1E use unicode characters but still use 1-byte per character counting?
Ruby, 84 bytes
->s,i{t="";i.times{|n|s.ljust(i*(s.length/i+1)).scan(/#{?.*i}/).each{|j|t<<j[n]}};t}
Terrible score, tips appreciated.
