Open ghost opened 6 years ago
It is counting the most frequent 2 character long substring which occurs the most number of times but without using any sorting algorithm but by using hashmaps and treemaps in java which reduces the time complexity.
It is counting the most frequent 2 character long substring which occurs the most number of times but without using any sorting algorithm but by using hashmaps and treemaps in java which reduces the time complexity.