Arrange Match Results in Repeating Win-Draw-Loss Order
Company: Capital One
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Take-home Project
# Arrange Match Results in Repeating Win-Draw-Loss Order
You are given a string containing only `W`, `D`, and `L`. Rearrange all characters into rounds. In each round, append at most one remaining `W`, then one remaining `D`, then one remaining `L`, skipping any character whose supply is exhausted. Continue until no characters remain.
Return the resulting string.
## Function Signature
```python
def arrange_results(results: str) -> str:
...
```
## Constraints
- `0 <= len(results) <= 1_000_000`
- Every character in `results` is one of `W`, `D`, or `L`.
- The output must contain exactly the same multiset of characters as the input.
## Examples
```text
Input: results = "WWWLLDDLD"
Output: "WDLWDLWDL"
```
```text
Input: results = "WLDDL"
Output: "WDLDL"
```
```text
Input: results = "WWWWLDDL"
Output: "WDLWDLWW"
```
Quick Answer: Rearrange a multiset of win, draw, and loss markers into repeated W-D-L rounds, skipping any marker once its supply is exhausted. The problem tests exact multiset preservation, deterministic round order, imbalanced supplies, empty input, and efficient construction for strings up to one million characters.
