Skip to content
ADevGuide Logo ADevGuide
Go back

Merge Strings Alternately - Leetcode Java Solution

By Pratik Bhuite | 3 min read

Hub: Java / LeetCode in Java

Series: Java Interview & Problem Solving Series

Last verified: Jun 8, 2021

Part 7 of 11 in the Java Interview & Problem Solving Series

Key Takeaways

On this page
Reading Comfort:

Merge Strings Alternately – Leetcode Java Solution

Today we will be solving the Leetcode question “Merge Strings Alternately” from the easy category.

Problem Statement

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.

Return the merged string.

Explanation

Input:

word1 = “abc”, word2 = “pqr”

Output:

“apbqcr”

The merged string will be merged as so: word1: a b c word2: p q r merged: a p b q c r

Constraints

  • 1 <= word1.length, word2.length <= 100
  • word1 and word2 consist of lowercase English letters.

Reverse An Integer In Java 8 – Simple Code Example

Test Cases

Test Case 1

Input:

word1 = “ab”, word2 = “pqrs”

Output:

“apbqrs”

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

Test Case 2

Input:

word1 = “abcd”, word2 = “pq”

Output:

“apbqcd”

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

Solution

https://leetcode.com/problems/merge-strings-alternately/


Share this post on:

Next in Series

Continue through the Java Interview & Problem Solving Series with the next recommended article.

Related Posts

Keep Learning with New Posts

Subscribe through RSS and follow the project to get new series updates.

Was this guide helpful?

Share detailed feedback

Previous Post
Reverse Words in a String III - LeetCode Java 8 Solution
Next Post
Kids With the Greatest Number of Candies - Leetcode Java Solution