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

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

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

| 2260|[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2260.java)|| Medium||

| 2259|[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2259.java)|| Easy||

packagecom.fishercoder.solutions;

publicclass_2269 {

publicstaticclassSolution1 {

publicintdivisorSubstrings(intnum,intk) {

StringnumStr =newStringBuilder().append(num).toString();

intans =0;

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

Stringcandidate =numStr.substring(i,i +k);

intinteger =Integer.parseInt(candidate);

if (integer ==0) {

continue;

}

if (num %integer ==0) {

ans++;

}

}

returnans;

}

}

}