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

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

|1805|[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1805.java)||Medium|String|

|1800|[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1800.java)||Easy|Two Pointers|

|1797|[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1797.java)||Medium|HashTable, Design|

|1796|[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1796.java)||Easy|String|

packagecom.fishercoder.solutions;

importjava.util.HashSet;

importjava.util.Set;

publicclass_1805 {

publicstaticclassSolution1 {

publicintnumDifferentIntegers(Stringword) {

StringBuildersb =newStringBuilder();

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

if (!Character.isDigit(word.charAt(i))) {

sb.append(" ");

}else {

sb.append(word.charAt(i));

}

}

String[]numbers =sb.toString().split("\\s+");

Set<String>set =newHashSet<>();

for (Stringnum :numbers) {

if (!num.isEmpty()) {

set.add(num.replaceFirst("^0+(?!$)",""));

}

}

returnset.size();

}

}

}