about | help | code help+videos | done | prefs |
noX
Given a string, compute recursively a new string where all the ‘x’ characters have been removed. For example, if the input is “xaxb”, the output should be “ab”. If the input is “abc”, the output is “abc”. If the input is “xx”, the output is an empty string. noX("xaxb") → "ab" noX("abc") → "abc" noX("xx") → "" ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 305
Copyright Nick Parlante 2017 - privacy