0
/ 50

Given a non-negative int `n`

, return the sum of its digits recursively (no loops). Note that mod (`%`

) by 10 yields the rightmost digit (126...

Searching for: modulus

0
/ 50

`n`

, return the sum of its digits recursively (no loops). Note that mod (`%`

) by 10 yields the rightmost digit (126...

0
/ 50

Given a non-negative int `n`

, compute recursively (no loops) the count of the occurrences of 8 as a digit, except that an 8 with another 8...

0
/ 50

Given a non-negative int `n`

, return the count of the occurrences of 7 as a digit, so for example 717 yields 2. (no loops). Note that mod (...

0
/ 10

Complete this method so it prints out the remainder of the two parameters.

0
/ 10

Wilsonâ€™s Shipping Company charges the following rates:

Weight of Package

Rate per 500 Miles Shipped

2 pounds or less

$1.10

Over 2 lbs...