Hidden Pattern String
Given two strings – a text A and a pattern B, having lower-case alphabetic characters. You have to determine the number of occurrences of pattern B in text A as its substring. i.e. the number of times B occurs as a substring in A. Problem Constraints 1 <= |B| <= |A| <= 105 Input Format First argument is a …