in Digit sum successor which is a medium level puzzle, my code times out in 5th and 7th test cases! I’m actually incrementing the number, get its sum, and then compare it to the sum of the N which’s brute forcing. So how can I make it more efficient? Thanks in advance

A post was merged into an existing topic: Digit sum successor