This raises an interesting problem--could we find the word even faster by using something other than a standard binary search?<p>The first thing that comes to mind is skipping past letters that don&#x27;t appear very often at that point in a word with the current prefix--or to be more granular, you could change your counter (here g) to a float and somehow weight each letter by how rarely it occurs after the letters you&#x27;ve established so far. So if you&#x27;ve currently established that the first four letters are &quot;pro,&quot; and &quot;z&quot; almost never occurs after those letters, &quot;z&quot; might be given a weight above 1 so the counter skips right past it.