# Your Problem:
# 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).
#
#
# count7(717) → 2
# count7(7) → 1
# count7(123) → 0
#
# Credit for this problem goes to Nick Parlante from CodingBat.com
# Do not modify anything outside of the function or the function itself.
# CODE START
def getCount7(num:int) -> int:
# CODE END
# Press Ctrl+E (Command+E on mac) to test your code