***********Challenge****************

Question

make programming which will accept to words or name and find out the similar alphabets on each.
example :-
IWIN
CLINT
similar alphabets are = 2
("I"&"N" is present on both the words )
else other not similar =7

(Remember only find the similarities on both words not of one because you can see in"IWIN" to
"I" is already present).

this programming is applicable to all programming languages.

Answer 1

Please explain, how do you count not similar letters?
Did you count the "N" letters?
"N" is also presented in both words.

Answer 2

#python...
#input system:kazi,mridul
#output:1
a=input().split(",");
print(len([i for i in a[0] if i in a[1]]))

Answer 3

#python...
#another way..
#but don't run it sololearn.
#run it python compiler if u have
print(len([i for i in input() if i in input()]))

Answer 4

Yeah, your challenge is phrased really bad...
I hope I understood you correctly. Here's my attempt:
https://code.sololearn.com/W14kZ9g1p5hE/?ref=app