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 (...
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 (%
) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12).
Your feedback will appear here when you check your answer.