PYTHON BASIC PROBLEMS SOLUTIONS(HACKERRANK) Day-20LEARN CODING EASILY. HOW TO BE GOOD PROGRAMMER?
HII Young Coders our channel will give you Hackerrank solutions.It will be very useful for you Kindly make use of it.
PROBLEM LINK:
https://www.hackerrank.com/challenges...
PROBLEM:
In this challenge, the user enters a string and a substring. You have to print the number of times that the substring occurs in the given string. String traversal will take place from left to right, not from right to left.
NOTE: String letters are case-sensitive.
Input Format
The first line of input contains the original string. The next line contains the substring.
Constraints
length of string = 0 to 200
Each character in the string is an ascii character.
Output Format
Output the integer number indicating the total number of occurrences of the substring in the original string.
Sample Input
ABCDCDC
CDC
Sample Output
2
Concept
Some string processing examples, such as these, might be useful.
There are a couple of new concepts:
In Python, the length of a string is found by the function len(s), where s is the string.
To traverse through the length of a string, use a for loop:
for i in range(0, len(s)):
print (s[i])
A range function is used to loop over some length:
range (0, 5)
Here, the range loops over 0 to 4,5. is excluded.
SOLUTION:
def count_substring(string, sub_string):
count=0
for i in range(len(string)):
l=string[i:(len(sub_string)+i)]
if(l== sub_string):
count+=1
return count
if _name_ == '__main__':
string = input().strip()
sub_string = input().strip()
count = count_substring(string, sub_string)
print(count)
In questa pagina del sito puoi guardare il video online PYTHON BASIC PROBLEMS SOLUTIONS(HACKERRANK) Day-20LEARN CODING EASILY. HOW TO BE GOOD PROGRAMMER? della durata di ore minuti seconda in buona qualità , che l'utente ha caricato TECHPARK 12 febbraio 2022, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 12 volte e gli è piaciuto 2 spettatori. Buona visione!
