In the world of Dota$2$, there are two parties: the Radiant and the Dire.

The senate consists of senators from both parties. Each senator belongs to one of the two parties and participates in a round based voting process to determine the outcome.

In each round, senators act in the order they appear from left to right. Each active senator can exercise one of the following two rights:

1. Ban a Senator’s Voting Right: An active senator can ban one senator from the opposing party, causing them to lose all rights to vote in this round and all subsequent rounds.

2. Announce Victory: If an active senator finds that all remaining active senators belong to their own party, they can announce victory for their party and conclude the voting process.

Suppose every senator plays greedily and adopts the best strategy to secure victory for their party. Given a string senate representing each senator’s party affiliation where 'R' represents Radiant and 'D' represents Dire, determine which party will win.

Return "Radiant" if the Radiant party wins, or "Dire" if the Dire party wins.

Constraints:

• $n ==$ senate.length

• $1 \leq n \leq 10^4$

• senate[i] is either 'R' or 'D'

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.