I'm working on a puzzle. I'm about 75% of the way through solving the puzzle.
The only thing left is you hash 33 two character pairs. I have 32 two character pairs.
Possible characters are [a-z, A-Z, 0-9]
Positionally the 33rd two character pair can be at the beginning, in between every other pair, or at the end.
Once a 33 two character pair is generated.
My programming skills are so rusty, that this one is causing me brain cramps.
Any help would be greatly appreciated.