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
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9 | Set 2
- 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 palindromic subsequences to be removed to empty a binary string
- Find number of times a string occurs as a subsequence in given string
- Sum of all subsequences of a number
- Number of subsequences of the form a^i b^j c^k
- Number of palindromic subsequences of length k where k <= 3
- Check if a string can become empty by recursively deleting a given sub-string
- Number of GP (Geometric Progression) subsequences of size 3
- Count minimum number of subsets (or subsequences) with consecutive numbers
- Find total number of distinct years from a string
- Find the missing number in a string of numbers with no separator
- Decode a string recursively encoded as count followed by substring