Find the count of sub-strings whose characters can be rearranged to form the given word in Python

Suppose we have a string S (all letters are in lowercase), we have to find the count of all of the sub-strings of length four whose characters can be rearranged to form this word "bird".

So, if the input is like "birdb", then the output will be 2.

To solve this, we will follow these steps −

• cnt := 0

• for i in range 0 to size of s - 3, do

  • bird := an array with [0, 0, 0, 0]

  • for j in range i to i + 4, do

    • if s[j] is same as 'b', then

      • bird[0] := bird[0] + 1

    • otherwise when s[j] is same as 'i', then

      • bird[1] := bird[1] + 1

    • otherwise when s[j] is same as 'r', then

      • bird[2] := bird[2] + 1

    • otherwise when s[j] is same as 'd', then

      • bird[3] := bird[3] + 1

    • if bird is same as [1,1,1,1], then

      • cnt := cnt + 1

• return cnt

Example 

Let us see the following implementation to get better understanding −

 Live Demo

def number_of_occurrence(s):
   cnt = 0
   for i in range(0, len(s) - 3):
      bird = [0, 0, 0, 0]
      for j in range(i, i + 4):
         if s[j] == 'b':
            bird[0] += 1
         elif s[j] == 'i':
            bird[1] += 1
         elif s[j] == 'r':
            bird[2] += 1
         elif s[j] == 'd':
            bird[3] += 1
      if bird == [1,1,1,1]:
         cnt += 1
   return cnt
s = "birdb"
print(number_of_occurrence(s))

Input

"birdb"

Output

2

Arnab Chakraborty

Updated on 19-Aug-2020 11:41:47

• Related Questions & Answers
• Check if characters of a given string can be rearranged to form a palindrome in Python
• Count of sub-arrays whose elements can be re-arranged to form palindromes in C++
• C++ program to find how many characters should be rearranged to order string in sorted form
• Check if a string can be rearranged to form special palindrome in Python
• Can part of a string be rearranged to form another string in JavaScript
• Check if the elements of the array can be rearranged to form a sequence of numbers or not in JavaScript
• Find the count of palindromic sub-string of a string in its sorted form in Python
• Program to count number of palindromes of size k can be formed from the given string characters in Python
• Count of sub-strings of length n possible from the given string in C++
• Count pairs of non-overlapping palindromic sub-strings of the given string in C++
• Java program to count the characters in each word in a given sentence
• Find all distinct palindromic sub-strings of a given String in Python
• Program to find length of longest word that can be formed from given letters in python
• Check if characters of one string can be swapped to form other in Python
• Find all palindromic sub-strings of a given string - Set 2 in Python