java doubt

[fake_Bezawada]

https://www.hackerrank.com/challenges/connected-cell-in-a-grid

 

need solution to this in java 

[fake_Bezawada]

Little Santa has made a list of all the nice children to whom he have to give the present. While getting ready to deliver the gifts he forgot where he kept the list. He remembered a string SS containing lowercase letters and stars ( * ). Star denotes that he didn't remember that letter of the string SS.

Little Santa is wondering what is the maximum number of names of the nice children in the list that can possibly match with the string SS if he will change at most one letter in the string SS to a star. String AA can possibly match with the string SS if letters on non star positions are equal. He is getting late to deliver the gifts so he asked you to solve this.

Note: All the names and the string SS will have same length.

Input format:
First line contains a string SS (1≤|S|≤3000)(1≤|S|≤3000), denoting the star string. SS only contains lowercase letters and stars ( * ). Second line contains an integer NN (1≤N≤3000)(1≤N≤3000), denoting the number of names on the list. Next NN lines contains a string each, stristri (1≤|stri|≤3000)(1≤|stri|≤3000), denoting the names of the children on the list. stristri consists of only lowercase letters.

Output format:
Print an integer denoting the maximum number of names of the nice children in the list that can possibly match with the string SS if he willchange at most one letter in the string SS to a star.

SAMPLE INPUT

 

 

a*c
3
abc
add
agd

SAMPLE OUTPUT

 

 

3

 

deeniki evaranna solution iyyanda please

[Manikyam]

yes vadi danilo ne code install and take backup to cloud

[Manikyam]

aapice danilo kastam... cz u need admin perm

[Manikyam]

yich i think u cannot be admimn on chomeonech lyapthop