Count Characters
Problem
Given a string, count the occurrence of given characters in the string.
Input will contain a string and some characters.
Count the occurrence of entered characters (irrespective of the case of characters) in the entered string altogether and show it in the output.
Time Limit: 5
Memory Limit: 256
Source Limit:
Explanation
Example 1:-
Entered string:- Love the life you live.
Entered Characters:- l i t
Output:- 6
Example 2:-
Entered string:- So I was being a little devious here! The trick, as you will probably have guessed, lies in the fact that it’s unclear as to whether Black can legally castle. In fact, it’s impossible to know given this position. However, despite not knowing this, one can prove that there exists a mate in 2.
Entered Characters:- s i d
Output:- 44
