Given a string s and a number k, return the number of substrings of length 3 where the difference between the first and third character is exactly k.

Note: This problem uses k=1 for simplicity.