title: Fast String Search like startsWith() not equals()
body: <p>I have an ordered list (a dictionary - 100K words) and many words to seach on this list frequently. So performance is an issue. I know that a HashSet.contains(theWord) or Collections.binarySearch(sortedList, theWord) are very fast. But I am actually not looking for the whole word. </p>
  
  <p>What I want is let's say searching for "se" and getting all the words starts with "se". So is there a ready to use solution in Java or any libraries?</p>
  
  <p>A better example: On a sorted list a quick solution for the following operation</p>
  
  <p>List.subList (String beginIndex, String endIndex) // returns the interval </p>
  
  <p>myWordList.subList(“ab”, “bc”);</p>
  
  <p>Note: Here is a very similar question but accepted answer is not satisfying.
  <a href="https://stackoverflow.com/questions/2015374/overriding-hashsets-contains-method">Overriding HashSet&#39;s Contains Method</a></p>