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

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

|1848|[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1848.java)||Easy|Array|

|1845|[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1845.java)||Medium|Heap, Design|

|1844|[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java)||Easy|String|

|1837|[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1837.java)||Easy|Math, Bit Manipulation|

packagecom.fishercoder.solutions;

publicclass_1848 {

publicstaticclassSolution1 {

publicintgetMinDistance(int[]nums,inttarget,intstart) {

intresult =0;

intminDiff =Integer.MAX_VALUE;

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

if (nums[i] ==target) {

if (Math.abs(start -i) <minDiff) {

minDiff =Math.abs(start -i);

result =minDiff;

}

}

}

returnresult;

}

}

}