solves merge strings alternately

Author: anishLearnsToCode

README.md

@@ -431,7 +431,7 @@
 | 1752 | [Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated)                                                |                                                         [![Java](assets/java.png)](src/CheckIfArrayIsSortedAndRotated.java)                                                          |                                                                                                                                   |
 | 1758 | [Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string)                      |                                                   [![Java](assets/java.png)](src/MinimumChangesToMakeAlternatingBinaryString.java)                                                   |                                                                                                                                   |
 | 1763 | [Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring)                                                                            |                                                              [![Java](assets/java.png)](src/LongestNiceSubstring.java)                                                               |                                                                                                                                   |
-| 1768 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately)                                                                      |                                                                                                                                                                                      |                                                                                                                                   |
+| 1768 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately)                                                                      |                                                             [![Java](assets/java.png)](src/MergeStringsAlternately.java)                                                             |                                                                                                                                   |
 | 1773 | [Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule)                                                                  |                                                                                                                                                                                      |                                                                                                                                   |
 | 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)            |                                                                                                                                                                                      |                                                                                                                                   |

src/MergeStringsAlternately.java

@@ -0,0 +1,17 @@
+public class MergeStringsAlternately {
+    public String mergeAlternately(String word1, String word2) {
+        final StringBuilder result = new StringBuilder();
+        final String[] words = {word1, word2};
+        int i = 0, maxLen = Math.max(word1.length(), word2.length());
+        for (int[] indexes = {0, 0} ; indexes[0] < maxLen || indexes[1] < maxLen ; i ^= 1) {
+            result.append(get(words[i], indexes[i]));
+            indexes[i]++;
+        }
+        return result.toString();
+    }
+
+    private String get(String s, int index) {
+        if (index < s.length()) return s.charAt(index) + "";
+        return "";
+    }
+}