Best hashing algorithm in terms of hash collisions and performance for strings

Question

What would be the best hashing algorithm if we had the following priorities (in that order):

1. Minimal hash collisions
2. Performance

It doe

Answer 1

Here is a straightforward way of implementing it yourself: http://www.devcodenote.com/2015/04/collision-free-string-hashing.html

Here is a snippet from the post:

if say we have a character set of capital English letters, then the length of the character set is 26 where A could be represented by the number 0, B by the number 1, C by the number 2 and so on till Z by the number 25. Now, whenever we want to map a string of this character set to a unique number , we perform the same conversion as we did in case of the binary format