Given a string with multiple words, find the most common character.

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

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

Take three lowercase letters and print out binary.

Take three lowercase letters and print out binary.