| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1668|[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java)||Easy|String|

|1664|[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)|[Javascript](./javascript/_1664.js)||Medium|Greedy|

|1663|[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java)||Medium|Greedy|

|1662|[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1662.java)||Easy|String|

packagecom.fishercoder.solutions;

publicclass_1668 {

publicstaticclassSolution1 {

publicintmaxRepeating(Stringsequence,Stringword) {

StringBuildersb =newStringBuilder(word);

inttimes =0;

while (sequence.indexOf(sb.toString()) != -1) {

times++;

sb.append(word);

}

returntimes;

}

}

}