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

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

| 2283|[Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2283.java)|| Easy||

| 2279|[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2279.java)|| Medium||

| 2278|[Percentage of Letter in String](https://leetcode.com/problems/percentage-of-letter-in-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2278.java)|| Easy||

| 2270|[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2270.java)|| Medium||

packagecom.fishercoder.solutions;

importjava.util.HashMap;

importjava.util.Map;

publicclass_2283 {

publicstaticclassSolution1 {

publicbooleandigitCount(Stringnum) {

Map<Integer,Integer>map =newHashMap<>();

for (charc :num.toCharArray()) {

intn =Character.getNumericValue(c);

map.put(n,map.getOrDefault(n,0) +1);

}

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

intn =Character.getNumericValue(num.charAt(i));

inttimes =map.getOrDefault(i,0);

if (n !=times) {

returnfalse;

}

}

returntrue;

}

}

}