Input: A string of "a", "b" and "c". Output: Replace each "a" with "b". Constraint: 1 <= Input length <= 7
125 Steam results · Checked
Input: A string of "a", "b" and "c". Output: A comma separated list of binary numbers representing the number of a's, b's, and c's in the input string Constraint: 1 <= Input length <= 7
Input: A string of "a", "b" and "c". Output: return a count of each letter in binary. Constraint: 1 <= Input length <= 9
Input: A string of digits 0-9. Output: that number doubled. Constraint: 1 <= Input length <= 5
Input: a number between 1 and 999. Output: return true if divisible by 7, false otherwise. Constraint: 1 <= Input length <= 3
Input: A decimal integer. There are no leading zeros Output: If the number is divisible by 15, output "Fizzbuzz". Otherwise, if the number is divisible 5, output "Buzz". Otherwise, if the number is divisible by 3, output "Fizz". Otherwise, output the numbe
Input: The following part in order: - a string of "0" and "1" followed by a "," - 2 strings of "0" and "1" (can be empty) seperated by a "-" Output: Treat the string before "," as the current string, the string after "," as the command (with "-" meaning "=
Input: A decimal number but its length is 2. Output: Input converted to a binary number. Constraint: 00 <= Input <= 99
Input: A string of "a", "b" and "c". Output: Double each "a". Swap "b" and "c". Constraint: 1 <= Input length <= 7
Input: A string of "a", "b" and "c". Output: Replace each "a" with "b". Constraint: 1 <= Input length <= 7
Input: A string of "a", "b" and "c". Output: Replace each "a" with "b". Constraint: 1 <= Input length <= 7
Input: A string of "a", "b" and "c". Output: A string of 3 numbers, "1" to "7", such that the first number is a count of "a"'s., number 2 is a "b" count, etc. Constraint: 1 <= Input length <= 7