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

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

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

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

| 2256|[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2256.java)|| Medium||

| 2255|[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2255.java)|| Easy||

| 2248|[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2248.java)|| Easy||

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.HashMap;

importjava.util.List;

importjava.util.Map;

publicclass_2260 {

publicstaticclassSolution1 {

publicintminimumCardPickup(int[]cards) {

intmin =cards.length;

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

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

List<Integer>list =map.getOrDefault(cards[i],newArrayList<>());

list.add(i);

map.put(cards[i],list);

}

booleanfound =false;

for (intkey :map.keySet()) {

List<Integer>list =map.get(key);

for (inti =0;i <list.size() -1;i++) {

found =true;

min =Math.min(min,list.get(i +1) -list.get(i) +1);

}

}

if (!found) {

return -1;

}else {

returnmin;

}

}

}

}