Calculates the Hamming distance between two strings of equal length. The Hamming distance is the number of positions at which the corresponding characters differ. # Arguments `a` - The first string `b` - The second string # Returns The number of differing characters between `a` and `b` # Panics Panics if the strings have different lengths # Example ``` use the_algorithms_rust::bit_manipul
(a: &str, b: &str)
source not stored for this graph (policy: none)