How to Solve a Function in Haskell

Bryce used a function that was shown in a talk called point-free or die which he borrowed and then basically replicated and solved in both uh, Haskell. You're given two strings Uh in the classic example, it's like letters that represent the colors So like blue blue green green would be bb gg that would be the code. Then your guess might be blue yellow Green red so b y g r so you need to return A single integer value given these two sequences These two strings that returns the number of characters That match exactly In this string. This is just a function that returns you the number of red pins that you would have done so in Haskell we'll do it in Haskell