Find a String | Hacker Rank Solution in Python

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.


Solution:

def count_substring(s,b):
    return len([i for i in range(len(s)) if s[i:i+len(b)] == b])

if __name__ == '__main__':
    string = raw_input().strip()
    sub_string = raw_input().strip()
    
    count = count_substring(string, sub_string)
    print count

Comments

Post a Comment

Popular posts from this blog

Diagonal Difference | Hacker Rank Solution in C

Problem: Given a square matrix, calculate the absolute difference between the sums of its diagonals. For example, the square matrix   is shown below: 1 2 3 4 5 6 9 8 9 The left-to-right diagonal =  . The right to left diagonal =  . Their absolute difference is  . Solution: #include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int main() {     int a[100][100],n,c=0,d=0,i,j,sum=0;     scanf("%d",&n);     for(i=0;i<n;i++)         for(j=0;j<n;j++)             scanf("%d",&a[i][j]);     for(i=0;i<n;i++)          c=c+a[i][i];             for(i=0;i<n;i++)          d=d+a[i][n-1-i];     sum=abs(c-d);     printf("%d",sum);                   /* Enter your code here....
Read more

Counter game | Hacker Rank in C

Problem: Louise and Richard have developed a numbers game. They pick a number and check to see if it is a power of  . If it is, they divide it by  . If not, they reduce it by the next lower number which is a power of  . Whoever reduces the number to   wins the game. Louise always starts. Given an initial value, determine who wins the game. As an example, let the initial value  . It's Louise's turn so she first determines that   is not a power of  . The next lower power of   is  , so she subtracts that from   and passes   to Richard.   is a power of  , so Richard divides it by   and passes   to Louise. Likewise,   is a power so she divides it by   and reaches  . She wins the game. Update  If they initially set counter to  , Richard wins. Louise cannot make a move so she loses. Solution: #include <assert.h> #include <limits.h> #i...
Read more

Mutations| Hacker Rank Solution in Python

Problem: We have seen that lists are mutable (they can be changed), and tuples are immutable (they cannot be changed). Let's try to understand this with an example. You are given an immutable string, and you want to make changes to it. Example >>> string = "abracadabra" You can access an index by: >>> print string[5] a Solution: def  mutate_string(string, position, character):     l1= list (string)     l1[position]=character     stri =  '' .join(l1)      return  stri if  __name__ ==  '__main__' :     s =  raw_input ()     i, c =  raw_input ().split()     s_new = mutate_string(s,  int (i), c)      print  s_new
Read more