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

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

|1750|[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1750.java)||Medium|Two Pointers|

|1749|[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1749.java)||Medium|Greedy|

|1748|[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1748.java)||Easy|Array, HashTable|

|1745|[Palindrome Partitioning IV](https://leetcode.com/problems/palindrome-partitioning-iv/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1745.java)||Hard|String, DP|

packagecom.fishercoder.solutions;

publicclass_1750 {

publicstaticclassSolution1 {

publicintminimumLength(Strings) {

inti =0;

intj =s.length() -1;

if (s.charAt(i) ==s.charAt(j)) {

while (i <j &&s.charAt(i) ==s.charAt(j)) {

charc =s.charAt(i);

i++;

while (c ==s.charAt(i) &&i <j) {

i++;

}

j--;

while (c ==s.charAt(j) &&i <j) {

j--;

}

}

}

returni <=j ?s.substring(i,j).length() +1 :0;

}

}

}