id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

jebbert@volusia.k12.fl.us > buildStringX1
prev  |  next  |  chance

Write a RECURSIVE method that returns a string made by combining the numbers from 'lowest' to 'highest' into a string with no spaces between the numbers. Look at the test data for examples. As preconditions you may assume that 'lowest' is less than or equal to 'highest'. You MUST use RECURSION in a meaningful way to solve this problem.


buildStringX1(7, 7) → "7"
buildStringX1(7, 17) → "7891011121314151617"
buildStringX1(9, 20) → "91011121314151617181920"

...Save, Compile, Run (ctrl-enter)

public String buildStringX1(int lowest, int highest) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 310

Copyright Nick Parlante 2017 - privacy