Add: problem 1194

README.md

@@ -54,6 +54,8 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
+| <span id="1194">1194</span> | [Tournament Winners](https://leetcode.com/problems/tournament-winners) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/tournament-winners) | Hard |
+| <span id="1193">1193</span> | [Monthly Transactions I](https://leetcode.com/problems/monthly-transactions-i) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i) | Medium |
 | <span id="1192">1192</span> | [Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network "查找集群内的「关键连接」") | [Go](https://github.com/openset/leetcode/tree/master/problems/critical-connections-in-a-network) | Hard |
 | <span id="1191">1191</span> | [K-Concatenation Maximum Sum](https://leetcode.com/problems/k-concatenation-maximum-sum "K 次串联后最大子数组之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-concatenation-maximum-sum) | Medium |
 | <span id="1190">1190</span> | [Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses "反转每对括号间的子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-substrings-between-each-pair-of-parentheses) | Medium |

problems/critical-connections-in-a-network/README.md

@@ -7,7 +7,7 @@
 
 [< Previous](https://github.com/openset/leetcode/tree/master/problems/k-concatenation-maximum-sum "K-Concatenation Maximum Sum")
 
-Next >
+[Next >](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i "Monthly Transactions I")
 
 ## 1192. Critical Connections in a Network (Hard)
 

problems/day-of-the-week/README.md

@@ -1,6 +1,6 @@
 <!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
 <!--+----------------------------------------------------------------------+-->
-<!--|@author    Openset <openset.wang@gmail.com>                           |-->
+<!--|@author    openset <openset.wang@gmail.com>                           |-->
 <!--|@link      https://github.com/openset                                 |-->
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
@@ -46,9 +46,6 @@
 	<li>The given dates are valid&nbsp;dates between the years <code>1971</code> and <code>2100</code>.</li>
 </ul>
 
-### Related Topics
-  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
-
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/distance-between-bus-stops/README.md

@@ -1,6 +1,6 @@
 <!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
 <!--+----------------------------------------------------------------------+-->
-<!--|@author    Openset <openset.wang@gmail.com>                           |-->
+<!--|@author    openset <openset.wang@gmail.com>                           |-->
 <!--|@link      https://github.com/openset                                 |-->
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
@@ -61,9 +61,6 @@
 	<li><code>0 &lt;= distance[i] &lt;= 10^4</code></li>
 </ul>
 
-### Related Topics
-  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
-
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/maximum-number-of-ones/README.md

@@ -1,6 +1,6 @@
 <!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
 <!--+----------------------------------------------------------------------+-->
-<!--|@author    Openset <openset.wang@gmail.com>                           |-->
+<!--|@author    openset <openset.wang@gmail.com>                           |-->
 <!--|@link      https://github.com/openset                                 |-->
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
@@ -14,8 +14,8 @@
 
 
 ### Related Topics
-  [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]
   [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)]
+  [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]
 
 ### Hints
 <details>

problems/maximum-subarray-sum-with-one-deletion/README.md

@@ -1,6 +1,6 @@
 <!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
 <!--+----------------------------------------------------------------------+-->
-<!--|@author    Openset <openset.wang@gmail.com>                           |-->
+<!--|@author    openset <openset.wang@gmail.com>                           |-->
 <!--|@link      https://github.com/openset                                 |-->
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
@@ -47,9 +47,6 @@
 	<li><code>-10^4 &lt;= arr[i] &lt;= 10^4</code></li>
 </ul>
 
-### Related Topics
-  [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]
-
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/monthly-transactions-i/README.md

@@ -0,0 +1,14 @@
+<!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
+<!--+----------------------------------------------------------------------+-->
+<!--|@author    openset <openset.wang@gmail.com>                           |-->
+<!--|@link      https://github.com/openset                                 |-->
+<!--|@home      https://github.com/openset/leetcode                        |-->
+<!--+----------------------------------------------------------------------+-->
+
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/critical-connections-in-a-network "Critical Connections in a Network")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/tournament-winners "Tournament Winners")
+
+## 1193. Monthly Transactions I (Medium)
+
+

problems/monthly-transactions-i/mysql_schemas.sql

@@ -0,0 +1,6 @@
+create table if not exists Transactions (id int, country varchar(4), state enum('approved', 'declined'), amount int, trans_date date);
+Truncate table Transactions;
+insert into Transactions (id, country, state, amount, trans_date) values ('121', 'US', 'approved', '1000', '2018-12-18');
+insert into Transactions (id, country, state, amount, trans_date) values ('122', 'US', 'declined', '2000', '2018-12-19');
+insert into Transactions (id, country, state, amount, trans_date) values ('123', 'US', 'approved', '2000', '2019-01-01');
+insert into Transactions (id, country, state, amount, trans_date) values ('124', 'DE', 'approved', '2000', '2019-01-07');

problems/tournament-winners/README.md

@@ -0,0 +1,14 @@
+<!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
+<!--+----------------------------------------------------------------------+-->
+<!--|@author    openset <openset.wang@gmail.com>                           |-->
+<!--|@link      https://github.com/openset                                 |-->
+<!--|@home      https://github.com/openset/leetcode                        |-->
+<!--+----------------------------------------------------------------------+-->
+
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i "Monthly Transactions I")
+
+Next >
+
+## 1194. Tournament Winners (Hard)
+
+

problems/tournament-winners/mysql_schemas.sql

@@ -0,0 +1,19 @@
+Create table If Not Exists Players (player_id int, group_id int);
+Create table If Not Exists Matches (match_id int, first_player int, second_player int, first_score int, second_score int)
+;
+Truncate table Players;
+insert into Players (player_id, group_id) values ('10', '2');
+insert into Players (player_id, group_id) values ('15', '1');
+insert into Players (player_id, group_id) values ('20', '3');
+insert into Players (player_id, group_id) values ('25', '1');
+insert into Players (player_id, group_id) values ('30', '1');
+insert into Players (player_id, group_id) values ('35', '2');
+insert into Players (player_id, group_id) values ('40', '3');
+insert into Players (player_id, group_id) values ('45', '1');
+insert into Players (player_id, group_id) values ('50', '2');
+Truncate table Matches;
+insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('1', '15', '45', '3', '0');
+insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('2', '30', '25', '1', '2');
+insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('3', '30', '15', '2', '0');
+insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('4', '40', '20', '5', '2');
+insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('5', '35', '50', '1', '1');