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

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

|1608|[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1608.java)||Easy|Array|

|1604|[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1604.java)||Medium|String, Ordered Map|

|1603|[Design Parking System](https://leetcode.com/problems/design-parking-system/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1603.java)||Easy|Design|

|1601|[Maximum Number of Achievable Transfer Requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1601.java)||Hard|Backtracking|

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_1608 {

publicstaticclassSolution1 {

publicintspecialArray(int[]nums) {

Arrays.sort(nums);

intmax =nums[nums.length -1];

for (intx =1;x <=max;x++) {

intfound =0;

inti =nums.length -1;

while (i >=0 &&nums[i] >=x) {

i--;

found++;

}

if (found ==x) {

returnx;

}

}

return -1;

}

}

}