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

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

|1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java)||Easy|String|

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

packagecom.fishercoder.solutions;

publicclass_1768 {

publicstaticclassSolution1 {

publicStringmergeAlternately(Stringword1,Stringword2) {

StringBuildersb =newStringBuilder();

inti =0,j =0;

for (;i <word1.length() &&j <word2.length(); ) {

sb.append(word1.charAt(i++));

sb.append(word2.charAt(j++));

}

while (i <word1.length()) {

sb.append(word1.charAt(i++));

}

while (j <word2.length()) {

sb.append(word2.charAt(j++));

}

returnsb.toString();

}

}

}