We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d412a6e commit fe495e2Copy full SHA for fe495e2
recursions/recursive_digit_sum.py
@@ -35,7 +35,6 @@ def super_digit(n_str: str, repetitions: int) -> int:
35
9
36
"""
37
38
-
39
# Calculate the initial sum of the digits in n_str
40
digit_sum = sum(int(digit) for digit in n_str)
41
0 commit comments