LeetCode Anagram Steps Benchmark Comparison of the same algorithm implemented in Ruby, Python, Go, and Common Lisp. Problem Given two strings of the same length, find the minimum number of character replacements needed to make one an anagram of the other. Running Benchmarks ./run-benchmarks.sh