125 Steam results · Checked
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
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 "". Output: Check if the input is a legal parenthesized string. I.e, every "" after it.
Input: A binary integer greater than 1. Output: Its binary prime factors in ascending order, separated by commas. Constraint: 2 <= Input number <= 100
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 "a", "b" and "c". Output: Keep the first three letters, delete the rest. Constraint: 3 <= Input length <= 7
Input: A string of "a", "b" and "c". Output: Remove the last occurrence of "abc". Constraint: 1 <= Input length <= 9
Input: Nested lists consisting of "" Output: Maximum list depth as a decimal number Constraint: 1 <= depth <= 4
Input: A binary number. Output: Its square. Constraint: 1 <= Input number <= 31
Input: A string of "a", "b" and "c". Output: Replace each "a" with "c". Constraint: 1 <= Input length <= 7
Input: Two strings of "a", "b", "c" and "x", separated by a ",". Output: The string that comes before the other in the lexicographic order. Constraint: 1 <= String length <= 4 First string ≠ Second string Out of the 115260 possible test cases, only 10000 a
Input: A binary number. Output: Convert input to Roman numerals if it is less than 4000. Otherwise return error. Constraint: 1 <= Input number <= 10000 You may not use keywords in this level. <日本語訳> k-12 ローマ数字 2 入力: 2進数 出力: 入力値が4000より小さければローマ数字に変換する。そうでなけれ