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

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

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

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

| 2244|[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2244.java)|| Medium||

| 2243|[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)|| Easy||

| 2239|[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2239.java)|| Easy||

| 2220|[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2220.java)|| Easy||

| 2215|[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2215.java)|| Easy||

| 2210|[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2210.java)|| Easy||

packagecom.fishercoder.solutions;

publicclass_2239 {

publicstaticclassSolution1 {

publicintfindClosestNumber(int[]nums) {

intans =nums[0];

intminDiff =Math.abs(nums[0]);

for (inti =1;i <nums.length;i++) {

intdiff =Math.abs(nums[i]);

if (diff <minDiff) {

minDiff =diff;

ans =nums[i];

}elseif (diff ==minDiff &&nums[i] >ans) {

ans =nums[i];

}

}

returnans;

}

}

}