Input: A string of "a" and "b". Output: Group with commas and make sure there are at most two "a"s and two "b"s in each group. Constraint: 1 <= Input length <= 10

It is said that A=B is turing-complete even without keywords, but I failed to figure this one out by myself. Leaving the challenge to anyone else. Input: "a". Output: "aa". You may not use keywords in this level.

Input: A string of the maze including > exactly one "a" as your start; > exactly one "b" as the goal; > "_"s as floors you can walk on; > "|"s as walls you can't pass; > "h"s as hammers that allow you to break one wall per hammer; > "p"s as portals that al

Input: A string of "a", "b" and "c". Output: Remove the last occurrence of "abc". Constraint: 1 <= Input length <= 9

Input: A string of "". Output: Check if the input is a legal parenthesized string. I.e, every "" after it.

Input: Nested lists consisting of "" Output: Maximum list depth as a decimal number Constraint: 1 <= depth <= 4

Input: A binary integer greater than 1. Output: Its binary prime factors in ascending order, separated by commas. Constraint: 2 <= Input number <= 100

Input: A string of "a", "b" and "c". Output: The number of characters in this string in binary representation. Constraint: Input length >= 1