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

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

| 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||

| 2269|[Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2269.java)|| Easy||

| 2264|[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2264.java)|| Easy||

packagecom.fishercoder.solutions;

publicclass_2278 {

publicstaticclassSolution1 {

publicintpercentageLetter(Strings,charletter) {

intcount =0;

for (charc :s.toCharArray()) {

if (c ==letter) {

count++;

}

}

return (int)Math.floor((count *100.0 /s.length()));

}

}

}