about | help | code help+videos | done | prefs |
oct12_2018_SLHL_removeRecursion
Write a method that returns the input parameter 'str' with all occurrences of the word "recursion" in ANY combination of case (upper- or lower-case) removed from the 'str' string. The ONLY string methods you are allowed to use are .equals, .length, .substring, .charAt, .toUpperCase, .toLowerCase, and .compareTo. No other string methods are allowed. You may use other non-string Java commands and operations. You may choose to do this recursively, but recursion is NOT required. oct12_2018_SLHL_removeRecursion("remove recursion, no matter how ReCuRSIon appears") → "remove , no matter how appears" oct12_2018_SLHL_removeRecursion("once RECursiON seemed difficult. Now recurSION is easy.") → "once seemed difficult. Now is easy." oct12_2018_SLHL_removeRecursion("Nothing to remove here.") → "Nothing to remove here." ...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: 410
Copyright Nick Parlante 2017 - privacy