Arrange Match Results in Repeating Win-Draw-Loss Order

Question

The candidate is asked to write a function that arranges match results in a repeating win-draw-loss order based on the input results.

Codemia · Accepted Answer

To solve the problem of arranging match results in a repeating win-draw-loss order, I will first categorize the results into three separate lists: wins, draws, and losses. Then, I will iterate through these lists in a round-robin manner to construct the final ordered list.

Here is a Python implementation of the solution:

```python
def arrange_results(results):
    wins = []
    draws = []
    losses = []

for result in results:
        if result == 'W':
            wins.append(result)
        elif result == 'D':
            draws.append(result)
        elif result == 'L':
            losses.append(result)

arranged = []
    max_length = max(len(wins), len(draws), len(losses))
    for i in range(max_length):
        if i < len(wins):
            arranged.append(wins[i])
        if i < len(draws):
            arranged.append(draws[i])
        if i < len(losses):
            arranged.append(losses[i])

return arranged
```
This function categorizes the results and constructs the final list in the desired order.

The time complexity of this solution is O(n), where n is the number of match results, as we iterate through the input list once to categorize the results. The space complexity is also O(n) due to the additional lists created for wins, draws, and losses.

In my implementation, I have considered edge cases such as:
- An empty input list, which should return an empty list.
- Input lists that contain only one type of result (e.g., all wins), which should still work correctly.

This approach efficiently organizes the match results while maintaining clarity and readability in the code. I am open to discussing alternative methods or optimizations if needed.

Arrange Match Results in Repeating Win-Draw-Loss Order

Capital One

What the Interviewer Expects

Key Topics to Cover

How to Approach This

Possible Follow-up Questions

Sharpen Your Skills on Codemia

Sample Answer

Approach

Algorithm

Submit Your Answer

Capital One Software Engineer Interview Guide

Related Questions

Binary Search on graph

Count kth largest element in array

Find connected components in string

Merge Three Sorted strings

Binary Search on string