##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Set intersection application
Given two strings, find how many characters they have in common.
Input: Two lines, each containing a word.
Output: The count of characters that appear in both words.
Example:
"hello" and "world"2 (the letters 'l' and 'o' appear in both)Think about which set operation solves this directly.