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

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

|1763|[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java)||Easy|String|

|1759|[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java)||Medium|String ,Greedy|

|1758|[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java)||Easy|Greedy, Array|

|1754|[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java)||Medium|Greedy, Suffix Array|

packagecom.fishercoder.solutions;

publicclass_1763 {

publicstaticclassSolution1 {

publicStringlongestNiceSubstring(Strings) {

Stringlongest ="";

for (inti =0;i <s.length() -1;i++) {

for (intj =i;j <=s.length();j++) {

if (isNiceString(s.substring(i,j))) {

if (longest.length() <j -i) {

longest =s.substring(i,j);

}

}

}

}

returnlongest;

}

privatebooleanisNiceString(Stringstr) {

int[]uppercount =newint[26];

int[]lowercount =newint[26];

for (charc :str.toCharArray()) {

if (Character.isUpperCase(c)) {

uppercount[Character.toLowerCase(c) -'a']++;

}else {

lowercount[c -'a']++;

}

}

for (inti =0;i <uppercount.length;i++) {

if (uppercount[i] >0 &&lowercount[i] >0 || (uppercount[i] ==0 &&lowercount[i] ==0)) {

continue;

}else {

returnfalse;

}

}

returntrue;

}

}

}