Trying this year to solve it with as few as possible requirements and optimize for cpu / memory. Current requirements are for profiling and tests. I might change my mind in the future. I was not first ...
int alphabet_s[256]; // Alphabet of t letters to s int alphabet_t[256]; // Alphabet of s letters to t for (int i=0; i<256; i++){ // Fill alphabets with empty values ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results