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

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

|1781|[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1781.java)||Medium|HashTable, String|

|1780|[Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1780.java)||Medium|Math, Backtracking, Recursion|

|1779|[Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1779.java)||Easy|Array|

|1774|[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1774.java)||Medium|Greedy|

packagecom.fishercoder.solutions;

publicclass_1781 {

publicstaticclassSolution1 {

publicintbeautySum(Strings) {

intsum =0;

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

int[]charCount =newint[26];

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

charCount[s.charAt(j) -'a']++;

intbeauty =getMaxCount(charCount) -getMinCount(charCount);

sum +=beauty;

}

}

returnsum;

}

privateintgetMinCount(int[]charCount) {

intmin =Integer.MAX_VALUE;

for (inti =0;i <26;i++) {

if (charCount[i] !=0) {

min =Math.min(min,charCount[i]);

}

}

returnmin;

}

privateintgetMaxCount(int[]charCount) {

intmax =0;

for (inti =0;i <26;i++) {

if (charCount[i] !=0) {

max =Math.max(max,charCount[i]);

}

}

returnmax;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1781;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1781Test {

privatestatic_1781.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1781.Solution1();

}

publicvoidtest1() {

assertEquals(5,solution1.beautySum("aabcb"));

}

}