https://github.com/TheAlgorithms/Go/blob/master/strings/pali...
Can you tell how many extra memory allocations we are making to solve this problem? And how many are really needed? We could solve this with a for loop by directly comparing the characters and skipping non-alphabetical ones. This would be simpler to read and more efficient.
We should be careful with what we call "best practices for beginners", as they can sometimes lead to unnecessary complexity and inefficiency.