Count Pairs of Equal Substrings With Minimum Difference

Given a string and a threshold d, count the number of pairs of substrings of the same length whose Hamming distance is at least d. The core challenge is to efficiently compare many substring pairs (avoid brute force) using techniques like rolling hashes, suffix/substring indexing, bitsets or convolution to compute mismatches quickly.