about | help | code help+videos | done | prefs |
Write a RECURSIVE method that returns a string that represents a palindromic number made from 'num'. The way the palindrome is constructed is by first writing the digits of 'num' backwards and then forwards. Look at the test data for examples. As preconditions you may assume that 'num' is a positive integer much less than the maximum possible integer (for a Java int). palidromeNumX1(1) → "11" palidromeNumX1(572) → "275572" palidromeNumX1(8241) → "14288241" ...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