Improve and reinforce salesforce training & adoption using WalkMe's digital adoption platform. Start saving on costly employee training by creating fast intuitive Walk-Thrus for Salesforce. Claim your Free Account Now
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 immediately to its left counts double, so 8818 yields 4. 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).
count8(8) → 1
count8(818) → 2
count8(8818) → 4
Add your voice to the tech community where 5M+ people just like you are talking about what matters.
|How to share My.Settings in multiple application instances ?||7||74|
|convert Systemjs to Webpack||3||119|
|Website checklist for browser compatibility?||2||50|
|Bitwise and to sum elements||2||45|
Join the community of 500,000 technology professionals and ask your questions.