{"raw_statement":[{"iden":"statement","content":"Leet, (also known as 1337 sp34k or Elite Speak), was a prominent use of letter swapping during early internet culture. \n\nSet types of letters would be able to be substituted for different numbers which would have similarities to the letters they were replacing. For this basic translator, only these conversions are needed:\n\n_a_ = 4 _b_ = 8 _e_ = 3 _i_ = 1 _l_ = 1 _o_ = 0 _s_ = 5 _t_ = 7 _z_ = 2\n\nWill contain a single string to be translated\n\nReturn a leet translated piece of string\n\n"},{"iden":"input","content":"Will contain a single string to be translated"},{"iden":"output","content":"Return a leet translated piece of string"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ S $ be a string over the alphabet $ \\Sigma = \\{a, b, c, \\dots, z, A, B, \\dots, Z, \\text{digits}, \\text{punctuation}, \\dots\\} $.  \n\nLet $ \\sigma: \\{a, b, e, i, l, o, s, t, z\\} \\to \\{4, 8, 3, 1, 1, 0, 5, 7, 2\\} $ be the substitution mapping:  \n$$\n\\sigma(a) = 4,\\ \\sigma(b) = 8,\\ \\sigma(e) = 3,\\ \\sigma(i) = 1,\\ \\sigma(l) = 1,\\ \\sigma(o) = 0,\\ \\sigma(s) = 5,\\ \\sigma(t) = 7,\\ \\sigma(z) = 2\n$$\n\n**Constraints**  \n- $ S $ contains only printable ASCII characters.  \n- Only lowercase letters $ \\{a, b, e, i, l, o, s, t, z\\} $ are subject to substitution; all other characters remain unchanged.  \n- Uppercase variants of these letters are **not** substituted.\n\n**Objective**  \nCompute the transformed string $ S' $ such that for each character $ c \\in S $:  \n$$\nS'[i] = \n\\begin{cases}\n\\sigma(c) & \\text{if } c \\in \\{a, b, e, i, l, o, s, t, z\\} \\\\\nc & \\text{otherwise}\n\\end{cases}\n$$","simple_statement":"Replace letters in the string with these numbers: a→4, b→8, e→3, i→1, l→1, o→0, s→5, t→7, z→2. Keep all other characters unchanged.","has_page_source":false}