taking regularexpressionvalidator and using its validation expression property.

For searching the pattern you can use the KMP(Knuth-Morris-Pratt) algorithm. The KMP algorithm preprocess the pattern P by computing a failure function F that indicates the largest possible shift using previously performed comparisons. Running time of algorithm is O(n + m), which is optimal in the worst case sense. That is, in the worst case KMP algorithm we have to examine all the characters in the text and pattern at least once.

We can search pattern by using regular experssions

If you have the better answer, then send it to us. We will display your answer after the approval.
Rules to Post Answers in CoolInterview.com:-

There should not be any Spelling Mistakes.

There should not be any Gramatical Errors.

Answers must not contain any bad words.

Answers should not be the repeat of same answer, already approved.

Answer should be complete in itself.

Name :*
Email Id :*
Answer :*
Verification Code	Not readable? Load New Code
Enter the above shown code:*
	Inform me about updated answers to this question