D. J.:

- Added the leetcode problem and solution for 649

Author: nobodyPerfecZ

README.md

@@ -243,6 +243,7 @@
 - [637 Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/description/)
 - [643 Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/description/)
 - [646 Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/description/)
+- [649 Dota2 Senate](https://leetcode.com/problems/dota2-senate/description/)
 - [673 Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/description/)
 - [712 Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/description/)
 - [714 Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/)

awesome_python_leetcode/_649_dota2_senate.py

@@ -0,0 +1,40 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def predictPartyVictory(self, senate: str) -> str:
+        """
+        In the world of Dota2, there are two parties: the Radiant and the Dire.
+
+        The Dota2 senate consists of senators coming from two parties. Now the Senate
+        wants to decide on a change in the Dota2 game. The voting for this change is a
+        round-based procedure. In each round, each senator can exercise one of the two
+        rights:
+        - Ban one senator's right: A senator can make another senator lose all his
+        rights in this and all the following rounds.
+        - Announce the victory: If this senator found the senators who still have
+        rights to vote are all from the same party, he can announce the victory and
+        decide on the change in the game.
+
+        Given a string senate representing each senator's party belonging. The
+        character 'R' and 'D' represent the Radiant party and the Dire party. Then if
+        there are n senators, the size of the given string will be n.
+
+        The round-based procedure starts from the first senator to the last senator in
+        the given order. This procedure will last until the end of voting. All the
+        senators who have lost their rights will be skipped during the procedure.
+
+        Suppose every senator is smart enough and will play the best strategy for his
+        own party. Predict which party will finally announce the victory and change the
+        Dota2 game. The output should be "Radiant" or "Dire".
+        """
+        queue = list(senate)
+        while len(queue) > 1:
+            senator = queue.pop(0)
+            another = "D" if senator == "R" else "R"
+            try:
+                index = queue.index(another)
+            except ValueError:
+                break
+            queue.pop(index)
+            queue.append(senator)
+        return "Radiant" if queue.pop(0) == "R" else "Dire"

tests/test_649_dota2_senate.py

@@ -0,0 +1,17 @@
+import pytest
+
+from awesome_python_leetcode._649_dota2_senate import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["senate", "expected"],
+    argvalues=[
+        ("RD", "Radiant"),
+        ("RDD", "Dire"),
+        ("DDR", "Dire"),
+    ],
+)
+def test_func(senate: str, expected: str):
+    """Tests the solution of a LeetCode problem."""
+    senator = Solution().predictPartyVictory(senate)
+    assert senator == expected