---Need new Programmer, my freelancer got into an accident---
C++
Need it done in -1 day.
I will share a movie with shortlisted candidates.
One thing I forgot to add to the movie: After we build the stub tree of 3 letters, never increment these letters ever again, only the ones after them.
About how much to divide each 'set' of 256 %s, we start with set1 of 3 letters where we know it's 100% accurate, no division. Now say we have 2 sets, it'll lose some of the 100% to set2. We actually get set2's division free - if you find the first 3 of 4 letters, you see the count on the 3rd letter, meaning if it is 200 and the children (4th letters) total to 42 we know it is -1/4th seen all observations and gets that much division from set1 if you get me. For set3 aka 5 letters, we'll need to carry over this and estimate that if there's 200 of its first 3 letter's 4th letter predictions in total count while only has 42 there and if there's 8 of the 4th letters total count of it's 5th letter predictions, then the total for all 5th letters is probably -32. There first one is free to find, the rest would need to be found by using letter frequency.
About the recuiterMember since May 20, 2018 Jianguo Chang
from Antioquia, Colombia