Python – Possible Substring count from String
Last Updated :
11 May, 2023
Given target string and argument substring, count how many substrings can be constructed using string characters, repetitions not allowed.
Input : test_str = “geksefokesgergeeks”, arg_str = “geeks”
Output : 3
Explanation : “geeks” can be created 3 times using string characters.
Input : test_str = “gefroksefokesgergeeks”, arg_str = “for”
Output : 2
Explanation : “for” can be created 2 times using string characters.
Method #1 : Using count() + min() + set()
The combination of above functions can be used to solve this problem. In this, we divide the count of each element of arg string with count of target string character, and using min(), the lowest element is returned. The logic behind is that any element above min would mean the minimum element would miss from that string onwards.
Python3
test_str = "gekseforgeeks"
print ( "The original string is : " + str (test_str))
arg_str = "geeks"
res = min (test_str.count(char) / / arg_str.count(char) for char in set (arg_str))
print ( "Possible substrings count : " + str (res))
|
Output
The original string is : gekseforgeeks
Possible substrings count : 2
Time Complexity: O(n)
Auxiliary Space: O(1)
Method #2 : Using Counter() + list comprehension
This is yet another way in which this task can be performed. In this, we perform the task of counting using Counter() and list comprehension is used to bind the result together, using min() performing similar task as previous method.
Python3
from collections import Counter
test_str = "gekseforgeeks"
print ( "The original string is : " + str (test_str))
arg_str = "geeks"
temp1 = Counter(test_str)
temp2 = Counter(arg_str)
res = min (temp1[char] / / temp2[char] for char in temp2.keys())
print ( "Possible substrings count : " + str (res))
|
Output
The original string is : gekseforgeeks
Possible substrings count : 2
The Time and Space Complexity for all the methods are the same:
Time Complexity: O(n)
Auxiliary Space: O(n)
Method 3: using operator.countOf() method
Python3
import operator as op
test_str = "gekseforgeeks"
print ( "The original string is : " + str (test_str))
arg_str = "geeks"
res = min (op.countOf(test_str, char) / / op.countOf(arg_str, char)
for char in set (arg_str))
print ( "Possible substrings count : " + str (res))
|
Output
The original string is : gekseforgeeks
Possible substrings count : 2
Time Complexity: O(N)
Auxiliary Space : O(1)
Method #4: Using for loop, max_count
Approach:
- Initialize the test_str and arg_str, max count to cnt variable.
- Iterate through the each character in arg_str
- find the count of the character
- compare it with the max count, if it less than the max count
- then assign it to cnt.
- Finally print the count to see the possible substring count.
Python3
test_str = "geksefokesgergeeks"
print ( "The original string is: " ,test_str)
arg_str = "geeks"
arg_str = set (arg_str)
cnt = 10000
for i in arg_str:
m_cnt = test_str.count(i)
if m_cnt<cnt:
cnt = m_cnt
print ( "Possible substrings count: " ,cnt)
|
Output
The original string is: geksefokesgergeeks
Possible substrings count: 3
Time Complexity: O(N)
Auxiliary Space : O(1)
Please Login to comment...