content: package codingquestions.leetcode;
  
  /**
   * You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append the additional letters onto the end of the merged string.
   * <p>
   * Return the merged string.
   * <p>
   * <p>
   * <p>
   * Example 1:
   * <p>
   * Input: word1 = "abc", word2 = "pqr"
   * Output: "apbqcr"
   * Explanation: The merged string will be merged as so:
   * word1:  a   b   c
   * word2:    p   q   r
   * merged: a p b q c r
   * Example 2:
   * <p>
   * Input: word1 = "ab", word2 = "pqrs"
   * Output: "apbqrs"
   * Explanation: Notice that as word2 is longer, "rs" is appended to the end.
   * word1:  a   b
   * word2:    p   q   r   s
   * merged: a p b q   r   s
   * Example 3:
   * <p>
   * Input: word1 = "abcd", word2 = "pq"
   * Output: "apbqcd"
   * Explanation: Notice that as word1 is longer, "cd" is appended to the end.
   * word1:  a   b   c   d
   * word2:    p   q
   * merged: a p b q c   d
   **/
  
  public class MergeAlternatively {
      public String mergeAlternately(String word1, String word2) {
          StringBuilder result = new StringBuilder();
          int x = word1.length();
          int y = word2.length();
          int max = x > y ? x : y;
          for (int i = 0; i < max; i++) {
              if (i < word1.length()) result.append(word1.charAt(i));
              if (i < word2.length()) result.append(word2.charAt(i));
          }
          return result.toString();
      }
  }
  