Given a number as a string, write a function to find the number of substrings (or contiguous subsequences) of the given string which recursively add up to 9.
For example digits of 729 recursively add to 9,
7 + 2 + 9 = 18
Recur for 18
1 + 8 = 9
Input: 4189 Output: 3 There are three substrings which recursively add to 9. The substrings are 18, 9 and 189. Input: 999 Output: 6 There are 6 substrings which recursively add to 9. 9, 99, 999, 9, 99, 9
All digits of a number recursively add up to 9, if only if the number is multiple of 9. We basically need to check for s%9 for all substrings s. One trick used in below program is to do modular arithmetic to avoid overflow for big strings.
Following is a simple implementation based on this approach. The implementation assumes that there are no leading 0’s in input number.
Time complexity of the above program is O(n2). Please let me know if there is a better solution.
This article is contributed by Abhishek. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9 | Set 2
- Count the number of contiguous increasing and decreasing subsequences in a sequence
- Count subsequences in first string which are anagrams of the second string
- Construct a string that has exactly K subsequences from given string
- Find product of all elements at indexes which are factors of M for all possible sorted subsequences of length M
- Number of subsequences in a given binary string divisible by 2
- Count of subsequences which consists exactly K prime numbers
- Count subsequences which contains both the maximum and minimum array element
- Count of 'GFG' Subsequences in the given string
- Convert given string to another by minimum replacements of subsequences by its smallest character
- Minimum number of palindromic subsequences to be removed to empty a binary string
- Number of subsequences in a string divisible by n
- Number of subsequences as "ab" in a string repeated K times
- Number of ways to partition a string into two balanced subsequences
- Minimum number of subsequences required to convert one string to another
- Minimum number of subsequences required to convert one string to another using Greedy Algorithm
- Print all subsequences of a string
- Print all subsequences of a string | Iterative Method
- Print all subsequences of a string using ArrayList
- Print all subsequences of a string in Python