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

 

srp4379@lausd.net > combineDigitsReverse
prev  |  next  |  chance

Given a String, find any digits in the String and combine them to make a single number, in the order that they are encountered from RIGHT to LEFT - that is, in REVERSE ORDER. If there are no digits in the String, just return zero.


combineDigitsReverse("abc1def2ghi3jklm") → 321
combineDigitsReverse("hello45goodbye78") → 8754
combineDigitsReverse("1green0blue53red8purple") → 83501

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

public int combineDigitsReverse(String str) { }

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: 4

Copyright Nick Parlante 2017 - privacy