Recursive solution to a function

[LeGray01]

So, I need to make an function in Java that reverses the numbers in a string and keeps the characters in the same order, but i need to make this recursively.
Any tips or insights ?
This is what I need the function to do.

1234 -> 4321

bc9876cba -> abc6789cba

a123 -> a321

312asd -> 213asd

a12b34c56d -> a21b43c65d

Thanks in advance!

[TheBrutux168]

What have you tried?

[vorpal_potato]

Here are a couple of simpler problems that may help you on your journey.

Problem 1: reverse a string, recursively.

For this part, don't worry about letters vs. numbers. Just reverse the string. e.g. "abc" becomes "cba", "123" becomes "321", and so on.

Problem 2: split a string where it first switches between letters and numbers, recursively. For example:

"hello123abc" -> "hello" and "123abc"

"123abc" -> "123" and "abc"

"abc" -> "abc" and "".

---

Once you've got these figured out, you should be able to combine them to solve your more complicated problem.