smoran02/tech_interviews — pull request #3 by 1guangnian (2014-01-24 17:18:41+00:00)
Title: Create 06_longest_repeated_substring_check_answer.cpp

use binary search to find the best answer.When checking a possible answer x, put all the substrings of length x into a set. The time complexity seems to be O(n^3), not very sure. Again, not test on strong cases but supposed to be right.