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

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

|1765|[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java)||Medium|BFS, Graph|

|1764|[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1764.java)||Medium|Array, Greedy|

|1763|[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java)||Easy|String|

|1759|[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java)||Medium|String ,Greedy|

packagecom.fishercoder.solutions;

importjava.util.LinkedList;

importjava.util.Queue;

publicclass_1765 {

publicstaticclassSolution1 {

publicint[][]highestPeak(int[][]isWater) {

intm =isWater.length;

intn =isWater[0].length;

int[][]result =newint[m][n];

Queue<int[]>queue =newLinkedList<>();

for (inti =0;i <m;i++) {

for (intj =0;j <n;j++) {

if (isWater[i][j] ==1) {

queue.offer(newint[]{i,j});

}

}

}

int[]directions =newint[]{0,1,0, -1,0};

intheight =1;

while (!queue.isEmpty()) {

intsize =queue.size();

for (intj =0;j <size;j++) {

int[]curr =queue.poll();

for (inti =0;i <directions.length -1;i++) {

intnewx =directions[i] +curr[0];

intnewy =directions[i +1] +curr[1];

if (newx >=0 &&newx <m &&newy >=0 &&newy <n &&result[newx][newy] ==0) {

result[newx][newy] =height;

queue.offer(newint[]{newx,newy});

}

}

}

height++;

}

for (inti =0;i <m;i++) {

for (intj =0;j <n;j++) {

if (isWater[i][j] ==1) {

result[i][j] =0;

}

}

}

returnresult;

}

}

}