about | help | code help+videos | done | prefs |
Write a RECURSIVE method that returns 'num' number of "X"es in a string as shown by the test data. Your solution MUST be recursive. This CAN be done in one line! You may assume that 'num' will be non-negative. makeXs(0) → "" makeXs(1) → "X" makeXs(2) → "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: 310
Copyright Nick Parlante 2017 - privacy