Leetcode 1754. Largest Merge Of Two Strings

Given two strings, build the lexicographically largest merge by repeatedly taking the first character of either string; the core challenge is a greedy decision at each step, breaking ties by comparing the remaining suffixes lexicographically (efficiently handling lengths up to ~3000).