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.

./run-benchmarks.sh

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.gitignore		.gitignore
README.md		README.md
build-lisp.lisp		build-lisp.lisp
run-benchmarks.sh		run-benchmarks.sh
solution.go		solution.go
solution.lisp		solution.lisp
solution.py		solution.py
solution.rb		solution.rb