Largest Merge Of Two Strings LeetCode solution in Python

1
class Solution:
2
    def largestMerge(self, word1: str, word2: str) -> str:
3
        res = ""
4
        p1 = 0
5
        p2 = 0
6
        while p1 < len(word1) and p2 < len(word2):
7
            if word1[p1:] > word2[p2:]:
8
                res += word1[p1]
9
                p1 += 1
10
            else:
11
                res += word2[p2]
12
                p2 += 1
13

14
        res += word1[p1:] + word2[p2:]
15

16
        return res