logo Practice-It logo


Language/Type: Java recursion recursive programming
Author: Stuart Reges (on 2014/02/13)

Write a method evens that takes an integer parameter n and that returns the integer formed by removing the odd digits from n. For example:

    evens(8342116) returns 8426
    evens(4109) returns 40
    evens(8) returns 8

If a negative number with even digits other than zero is passed to the method, the result should also be negative, as in:

    evens(-34512) returns -42
    evens(-163505) returns -60

Any leading zeros in the result should be ignored and if there are no even digits other than zero in the number, the method should return zero, as in:

    evens(3052) returns 2
    evens(7010496) returns 46
    evens(35179) returns 0
    evens(5307) returns 0
    evens(7) returns 0

Write your solution to evens below.

Type your solution here:

This is a method problem. Write a Java method as described. Do not write a complete program or class; just the method(s) above.

You must log in before you can solve this problem.

Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.