Given two strings of equal length, figure out if one is a scramble of the other.

Start with one Fibonacci sequence number, then calculate more from there.

Take three lowercase letters and print out binary.

Take a list of integers and print it after sorting it in descending order.

Take a string of comma separated numbers and print out the sum.

Take a string of numbers and output the one which appears the most.

Just take any given string and output it in reverse, pretty easy, right?