Skip to content

Commit a7e7771

Browse files
author
Shuo
committed
A: new
1 parent 0dfdaa8 commit a7e7771

File tree

206 files changed

+1481
-175
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

206 files changed

+1481
-175
lines changed

Diff for: ‎README.md

+16
Original file line numberDiff line numberDiff line change
@@ -78,6 +78,22 @@ LeetCode Problems' Solutions
7878

7979
| # | Title | Solution | Difficulty |
8080
| :-: | - | - | :-: |
81+
| <span id="2004">2004</span> | [The Number of Seniors and Juniors to Join the Company](https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company) 🔒 | [MySQL](problems/the-number-of-seniors-and-juniors-to-join-the-company) | Hard |
82+
| <span id="2003">2003</span> | [Smallest Missing Genetic Value in Each Subtree](https://leetcode.com/problems/smallest-missing-genetic-value-in-each-subtree "每棵子树内缺失的最小基因值") | [Go](problems/smallest-missing-genetic-value-in-each-subtree) | Hard |
83+
| <span id="2002">2002</span> | [Maximum Product of the Length of Two Palindromic Subsequences](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences "两个回文子序列长度的最大乘积") | [Go](problems/maximum-product-of-the-length-of-two-palindromic-subsequences) | Medium |
84+
| <span id="2001">2001</span> | [Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles "可互换矩形的组数") | [Go](problems/number-of-pairs-of-interchangeable-rectangles) | Medium |
85+
| <span id="2000">2000</span> | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word "反转单词前缀") | [Go](problems/reverse-prefix-of-word) | Easy |
86+
| <span id="1999">1999</span> | [Smallest Greater Multiple Made of Two Digits](https://leetcode.com/problems/smallest-greater-multiple-made-of-two-digits) 🔒 | [Go](problems/smallest-greater-multiple-made-of-two-digits) | Medium |
87+
| <span id="1998">1998</span> | [GCD Sort of an Array](https://leetcode.com/problems/gcd-sort-of-an-array "数组的最大公因数排序") | [Go](problems/gcd-sort-of-an-array) | Hard |
88+
| <span id="1997">1997</span> | [First Day Where You Have Been in All the Rooms](https://leetcode.com/problems/first-day-where-you-have-been-in-all-the-rooms "访问完所有房间的第一天") | [Go](problems/first-day-where-you-have-been-in-all-the-rooms) | Medium |
89+
| <span id="1996">1996</span> | [The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game "游戏中弱角色的数量") | [Go](problems/the-number-of-weak-characters-in-the-game) | Medium |
90+
| <span id="1995">1995</span> | [Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets "统计特殊四元组") | [Go](problems/count-special-quadruplets) | Easy |
91+
| <span id="1994">1994</span> | [The Number of Good Subsets](https://leetcode.com/problems/the-number-of-good-subsets "好子集的数目") | [Go](problems/the-number-of-good-subsets) | Hard |
92+
| <span id="1993">1993</span> | [Operations on Tree](https://leetcode.com/problems/operations-on-tree "树上的操作") | [Go](problems/operations-on-tree) | Medium |
93+
| <span id="1992">1992</span> | [Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland "找到所有的农场组") | [Go](problems/find-all-groups-of-farmland) | Medium |
94+
| <span id="1991">1991</span> | [Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array "找到数组的中间位置") | [Go](problems/find-the-middle-index-in-array) | Easy |
95+
| <span id="1990">1990</span> | [Count the Number of Experiments](https://leetcode.com/problems/count-the-number-of-experiments) 🔒 | [MySQL](problems/count-the-number-of-experiments) | Medium |
96+
| <span id="1989">1989</span> | [Maximum Number of People That Can Be Caught in Tag](https://leetcode.com/problems/maximum-number-of-people-that-can-be-caught-in-tag) 🔒 | [Go](problems/maximum-number-of-people-that-can-be-caught-in-tag) | Medium |
8197
| <span id="1988">1988</span> | [Find Cutoff Score for Each School](https://leetcode.com/problems/find-cutoff-score-for-each-school) 🔒 | [MySQL](problems/find-cutoff-score-for-each-school) | Medium |
8298
| <span id="1987">1987</span> | [Number of Unique Good Subsequences](https://leetcode.com/problems/number-of-unique-good-subsequences "不同的好子序列数目") | [Go](problems/number-of-unique-good-subsequences) | Hard |
8399
| <span id="1986">1986</span> | [Minimum Number of Work Sessions to Finish the Tasks](https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks "完成任务的最少工作时间段") | [Go](problems/minimum-number-of-work-sessions-to-finish-the-tasks) | Medium |

Diff for: ‎problems/4sum/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -54,3 +54,4 @@
5454
1. [Two Sum](../two-sum) (Easy)
5555
1. [3Sum](../3sum) (Medium)
5656
1. [4Sum II](../4sum-ii) (Medium)
57+
1. [Count Special Quadruplets](../count-special-quadruplets) (Easy)

Diff for: ‎problems/all-paths-from-source-to-target/README.md

+4-1
Original file line numberDiff line numberDiff line change
@@ -65,7 +65,10 @@
6565
</ul>
6666

6767
### Related Topics
68+
[[Backtracking](../../tag/backtracking/README.md)]
6869
[[Depth-First Search](../../tag/depth-first-search/README.md)]
6970
[[Breadth-First Search](../../tag/breadth-first-search/README.md)]
7071
[[Graph](../../tag/graph/README.md)]
71-
[[Backtracking](../../tag/backtracking/README.md)]
72+
73+
### Similar Questions
74+
1. [Number of Ways to Arrive at Destination](../number-of-ways-to-arrive-at-destination) (Medium)

Diff for: ‎problems/arithmetic-subarrays/README.md

+4
Original file line numberDiff line numberDiff line change
@@ -64,6 +64,10 @@ In the 2<sup>nd</sup> query, the subarray is <code>[5,9,3,7]. This</code> can be
6464
[[Array](../../tag/array/README.md)]
6565
[[Sorting](../../tag/sorting/README.md)]
6666

67+
### Similar Questions
68+
1. [Arithmetic Slices](../arithmetic-slices) (Medium)
69+
1. [Can Make Arithmetic Progression From Sequence](../can-make-arithmetic-progression-from-sequence) (Easy)
70+
6771
### Hints
6872
<details>
6973
<summary>Hint 1</summary>

Diff for: ‎problems/average-of-levels-in-binary-tree/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ Given the <code>root</code> of a binary tree, return <em>the average value of th
1616
<p><strong>Example 1:</strong></p>
1717
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/09/avg1-tree.jpg" style="width: 277px; height: 302px;" />
1818
<pre>
19-
<strong>Input:</strong> root = [3,9,20,null,15,7]
19+
<strong>Input:</strong> root = [3,9,20,null,null,15,7]
2020
<strong>Output:</strong> [3.00000,14.50000,11.00000]
2121
Explanation: The average value of nodes on level 0 is 3, on level 1 is 14.5, and on level 2 is 11.
2222
Hence return [3, 14.5, 11].

Diff for: ‎problems/avoid-flood-in-the-city/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -93,10 +93,10 @@ After that, it will rain over lakes [1,2]. It&#39;s easy to prove that no matter
9393
</ul>
9494

9595
### Related Topics
96-
[[Greedy](../../tag/greedy/README.md)]
9796
[[Array](../../tag/array/README.md)]
9897
[[Hash Table](../../tag/hash-table/README.md)]
9998
[[Binary Search](../../tag/binary-search/README.md)]
99+
[[Greedy](../../tag/greedy/README.md)]
100100
[[Heap (Priority Queue)](../../tag/heap-priority-queue/README.md)]
101101

102102
### Hints

Diff for: ‎problems/best-position-for-a-service-centre/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -71,8 +71,8 @@ Be careful with the precision!
7171
</ul>
7272

7373
### Related Topics
74-
[[Geometry](../../tag/geometry/README.md)]
7574
[[Math](../../tag/math/README.md)]
75+
[[Geometry](../../tag/geometry/README.md)]
7676
[[Randomized](../../tag/randomized/README.md)]
7777

7878
### Hints

Diff for: ‎problems/binary-search-tree-iterator-ii/README.md

+3
Original file line numberDiff line numberDiff line change
@@ -21,6 +21,9 @@
2121
[[Binary Tree](../../tag/binary-tree/README.md)]
2222
[[Iterator](../../tag/iterator/README.md)]
2323

24+
### Similar Questions
25+
1. [Binary Search Tree Iterator](../binary-search-tree-iterator) (Medium)
26+
2427
### Hints
2528
<details>
2629
<summary>Hint 1</summary>

Diff for: ‎problems/build-an-array-with-stack-operations/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -68,8 +68,8 @@ Read number 3 and automatically push in the array -&gt; [1,3]
6868
</ul>
6969

7070
### Related Topics
71-
[[Stack](../../tag/stack/README.md)]
7271
[[Array](../../tag/array/README.md)]
72+
[[Stack](../../tag/stack/README.md)]
7373
[[Simulation](../../tag/simulation/README.md)]
7474

7575
### Hints

Diff for: ‎problems/bulb-switcher-iv/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -69,8 +69,8 @@ We need at least 3 flip operations to form target.</pre>
6969
</ul>
7070

7171
### Related Topics
72-
[[Greedy](../../tag/greedy/README.md)]
7372
[[String](../../tag/string/README.md)]
73+
[[Greedy](../../tag/greedy/README.md)]
7474

7575
### Hints
7676
<details>

Diff for: ‎problems/can-make-arithmetic-progression-from-sequence/README.md

+3
Original file line numberDiff line numberDiff line change
@@ -44,6 +44,9 @@
4444
[[Array](../../tag/array/README.md)]
4545
[[Sorting](../../tag/sorting/README.md)]
4646

47+
### Similar Questions
48+
1. [Arithmetic Subarrays](../arithmetic-subarrays) (Medium)
49+
4750
### Hints
4851
<details>
4952
<summary>Hint 1</summary>

Diff for: ‎problems/can-place-flowers/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -34,8 +34,8 @@
3434
</ul>
3535

3636
### Related Topics
37-
[[Greedy](../../tag/greedy/README.md)]
3837
[[Array](../../tag/array/README.md)]
38+
[[Greedy](../../tag/greedy/README.md)]
3939

4040
### Similar Questions
4141
1. [Teemo Attacking](../teemo-attacking) (Easy)

Diff for: ‎problems/check-if-two-expression-trees-are-equivalent/README.md

+3
Original file line numberDiff line numberDiff line change
@@ -18,6 +18,9 @@
1818
[[Depth-First Search](../../tag/depth-first-search/README.md)]
1919
[[Binary Tree](../../tag/binary-tree/README.md)]
2020

21+
### Similar Questions
22+
1. [Build Binary Expression Tree From Infix Expression](../build-binary-expression-tree-from-infix-expression) (Hard)
23+
2124
### Hints
2225
<details>
2326
<summary>Hint 1</summary>

Diff for: ‎problems/circle-and-rectangle-overlapping/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -64,8 +64,8 @@
6464
</ul>
6565

6666
### Related Topics
67-
[[Geometry](../../tag/geometry/README.md)]
6867
[[Math](../../tag/math/README.md)]
68+
[[Geometry](../../tag/geometry/README.md)]
6969

7070
### Hints
7171
<details>

Diff for: ‎problems/clone-binary-tree-with-random-pointer/README.md

+8-3
Original file line numberDiff line numberDiff line change
@@ -14,19 +14,24 @@
1414

1515

1616
### Related Topics
17+
[[Hash Table](../../tag/hash-table/README.md)]
1718
[[Tree](../../tag/tree/README.md)]
1819
[[Depth-First Search](../../tag/depth-first-search/README.md)]
1920
[[Breadth-First Search](../../tag/breadth-first-search/README.md)]
20-
[[Hash Table](../../tag/hash-table/README.md)]
2121
[[Binary Tree](../../tag/binary-tree/README.md)]
2222

23+
### Similar Questions
24+
1. [Clone Graph](../clone-graph) (Medium)
25+
1. [Copy List with Random Pointer](../copy-list-with-random-pointer) (Medium)
26+
1. [Clone N-ary Tree](../clone-n-ary-tree) (Medium)
27+
2328
### Hints
2429
<details>
2530
<summary>Hint 1</summary>
26-
Create an equivalent node for each node in the original tree.
31+
Traverse the tree, keep a hashtable with you and create a nodecopy for each node in the tree.
2732
</details>
2833

2934
<details>
3035
<summary>Hint 2</summary>
31-
Start traversing the original tree and connect the left, right and random pointers in the cloned tree the same way as the original tree.
36+
Start traversing the original tree again and connect the left, right and random pointers in the cloned tree the same way as the original tree with the help of the hashtable.
3237
</details>

Diff for: ‎problems/clone-n-ary-tree/README.md

+6-1
Original file line numberDiff line numberDiff line change
@@ -14,10 +14,15 @@
1414

1515

1616
### Related Topics
17+
[[Hash Table](../../tag/hash-table/README.md)]
1718
[[Tree](../../tag/tree/README.md)]
1819
[[Depth-First Search](../../tag/depth-first-search/README.md)]
1920
[[Breadth-First Search](../../tag/breadth-first-search/README.md)]
20-
[[Hash Table](../../tag/hash-table/README.md)]
21+
22+
### Similar Questions
23+
1. [Clone Graph](../clone-graph) (Medium)
24+
1. [Copy List with Random Pointer](../copy-list-with-random-pointer) (Medium)
25+
1. [Clone Binary Tree With Random Pointer](../clone-binary-tree-with-random-pointer) (Medium)
2126

2227
### Hints
2328
<details>

Diff for: ‎problems/closest-binary-search-tree-value/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -35,10 +35,10 @@
3535
</pre>
3636

3737
### Related Topics
38+
[[Binary Search](../../tag/binary-search/README.md)]
3839
[[Tree](../../tag/tree/README.md)]
3940
[[Depth-First Search](../../tag/depth-first-search/README.md)]
4041
[[Binary Search Tree](../../tag/binary-search-tree/README.md)]
41-
[[Binary Search](../../tag/binary-search/README.md)]
4242
[[Binary Tree](../../tag/binary-tree/README.md)]
4343

4444
### Similar Questions

Diff for: ‎problems/coloring-a-border/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -45,9 +45,9 @@
4545
</ul>
4646

4747
### Related Topics
48+
[[Array](../../tag/array/README.md)]
4849
[[Depth-First Search](../../tag/depth-first-search/README.md)]
4950
[[Breadth-First Search](../../tag/breadth-first-search/README.md)]
50-
[[Array](../../tag/array/README.md)]
5151
[[Matrix](../../tag/matrix/README.md)]
5252

5353
### Similar Questions

Diff for: ‎problems/consecutive-characters/README.md

+4
Original file line numberDiff line numberDiff line change
@@ -64,6 +64,10 @@
6464
### Related Topics
6565
[[String](../../tag/string/README.md)]
6666

67+
### Similar Questions
68+
1. [Max Consecutive Ones](../max-consecutive-ones) (Easy)
69+
1. [Count Number of Homogenous Substrings](../count-number-of-homogenous-substrings) (Medium)
70+
6771
### Hints
6872
<details>
6973
<summary>Hint 1</summary>

Diff for: ‎problems/constrained-subsequence-sum/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -49,12 +49,12 @@
4949
</ul>
5050

5151
### Related Topics
52-
[[Queue](../../tag/queue/README.md)]
5352
[[Array](../../tag/array/README.md)]
5453
[[Dynamic Programming](../../tag/dynamic-programming/README.md)]
54+
[[Queue](../../tag/queue/README.md)]
5555
[[Sliding Window](../../tag/sliding-window/README.md)]
56-
[[Monotonic Queue](../../tag/monotonic-queue/README.md)]
5756
[[Heap (Priority Queue)](../../tag/heap-priority-queue/README.md)]
57+
[[Monotonic Queue](../../tag/monotonic-queue/README.md)]
5858

5959
### Hints
6060
<details>

Diff for: ‎problems/convert-a-number-to-hexadecimal/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -33,5 +33,5 @@
3333
</ul>
3434

3535
### Related Topics
36-
[[Bit Manipulation](../../tag/bit-manipulation/README.md)]
3736
[[Math](../../tag/math/README.md)]
37+
[[Bit Manipulation](../../tag/bit-manipulation/README.md)]

Diff for: ‎problems/count-all-possible-routes/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -81,9 +81,9 @@
8181
</ul>
8282

8383
### Related Topics
84-
[[Memoization](../../tag/memoization/README.md)]
8584
[[Array](../../tag/array/README.md)]
8685
[[Dynamic Programming](../../tag/dynamic-programming/README.md)]
86+
[[Memoization](../../tag/memoization/README.md)]
8787

8888
### Hints
8989
<details>

Diff for: ‎problems/count-number-of-teams/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -57,9 +57,9 @@
5757
</ul>
5858

5959
### Related Topics
60-
[[Binary Indexed Tree](../../tag/binary-indexed-tree/README.md)]
6160
[[Array](../../tag/array/README.md)]
6261
[[Dynamic Programming](../../tag/dynamic-programming/README.md)]
62+
[[Binary Indexed Tree](../../tag/binary-indexed-tree/README.md)]
6363

6464
### Hints
6565
<details>

Diff for: ‎problems/count-special-quadruplets/README.md

+71
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,71 @@
1+
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
2+
<!--+----------------------------------------------------------------------+-->
3+
<!--|@author openset <[email protected]> |-->
4+
<!--|@link https://github.com/openset |-->
5+
<!--|@home https://github.com/openset/leetcode |-->
6+
<!--+----------------------------------------------------------------------+-->
7+
8+
[< Previous](../the-number-of-good-subsets "The Number of Good Subsets")
9+
　　　　　　　　　　　　　　　　
10+
[Next >](../the-number-of-weak-characters-in-the-game "The Number of Weak Characters in the Game")
11+
12+
## [1995. Count Special Quadruplets (Easy)](https://leetcode.com/problems/count-special-quadruplets "统计特殊四元组")
13+
14+
<p>Given a <strong>0-indexed</strong> integer array <code>nums</code>, return <em>the number of <strong>distinct</strong> quadruplets</em> <code>(a, b, c, d)</code> <em>such that:</em></p>
15+
16+
<ul>
17+
<li><code>nums[a] + nums[b] + nums[c] == nums[d]</code>, and</li>
18+
<li><code>a &lt; b &lt; c &lt; d</code></li>
19+
</ul>
20+
21+
<p>&nbsp;</p>
22+
<p><strong>Example 1:</strong></p>
23+
24+
<pre>
25+
<strong>Input:</strong> nums = [1,2,3,6]
26+
<strong>Output:</strong> 1
27+
<strong>Explanation:</strong> The only quadruplet that satisfies the requirement is (0, 1, 2, 3) because 1 + 2 + 3 == 6.
28+
</pre>
29+
30+
<p><strong>Example 2:</strong></p>
31+
32+
<pre>
33+
<strong>Input:</strong> nums = [3,3,6,4,5]
34+
<strong>Output:</strong> 0
35+
<strong>Explanation:</strong> There are no such quadruplets in [3,3,6,4,5].
36+
</pre>
37+
38+
<p><strong>Example 3:</strong></p>
39+
40+
<pre>
41+
<strong>Input:</strong> nums = [1,1,1,3,5]
42+
<strong>Output:</strong> 4
43+
<strong>Explanation:</strong> The 4 quadruplets that satisfy the requirement are:
44+
- (0, 1, 2, 3): 1 + 1 + 1 == 3
45+
- (0, 1, 3, 4): 1 + 1 + 3 == 5
46+
- (0, 2, 3, 4): 1 + 1 + 3 == 5
47+
- (1, 2, 3, 4): 1 + 1 + 3 == 5
48+
</pre>
49+
50+
<p>&nbsp;</p>
51+
<p><strong>Constraints:</strong></p>
52+
53+
<ul>
54+
<li><code>4 &lt;= nums.length &lt;= 50</code></li>
55+
<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
56+
</ul>
57+
58+
### Related Topics
59+
[[Array](../../tag/array/README.md)]
60+
[[Enumeration](../../tag/enumeration/README.md)]
61+
62+
### Hints
63+
<details>
64+
<summary>Hint 1</summary>
65+
N is very small, how can we use that?
66+
</details>
67+
68+
<details>
69+
<summary>Hint 2</summary>
70+
Can we check every possible quadruplet?
71+
</details>

Diff for: ‎problems/count-submatrices-with-all-ones/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -72,9 +72,9 @@ Total number of rectangles = 8 + 5 + 2 + 4 + 2 + 2 + 1 = 24<strong>.</strong>
7272
</ul>
7373

7474
### Related Topics
75-
[[Stack](../../tag/stack/README.md)]
7675
[[Array](../../tag/array/README.md)]
7776
[[Dynamic Programming](../../tag/dynamic-programming/README.md)]
77+
[[Stack](../../tag/stack/README.md)]
7878
[[Matrix](../../tag/matrix/README.md)]
7979
[[Monotonic Stack](../../tag/monotonic-stack/README.md)]
8080

Diff for: ‎problems/count-the-number-of-experiments/README.md

+14
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
2+
<!--+----------------------------------------------------------------------+-->
3+
<!--|@author openset <[email protected]> |-->
4+
<!--|@link https://github.com/openset |-->
5+
<!--|@home https://github.com/openset/leetcode |-->
6+
<!--+----------------------------------------------------------------------+-->
7+
8+
[< Previous](../maximum-number-of-people-that-can-be-caught-in-tag "Maximum Number of People That Can Be Caught in Tag")
9+
　　　　　　　　　　　　　　　　
10+
[Next >](../find-the-middle-index-in-array "Find the Middle Index in Array")
11+
12+
## [1990. Count the Number of Experiments (Easy)](https://leetcode.com/problems/count-the-number-of-experiments "")
13+
14+

Diff for: ‎problems/count-the-number-of-experiments/mysql_schemas.sql

+8
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
Create table If Not Exists Experiments (experiment_id int, platform ENUM('Android', 'IOS', 'Web'), experiment_name ENUM('Reading', 'Sports', 'Programming'));
2+
Truncate table Experiments;
3+
insert into Experiments (experiment_id, platform, experiment_name) values ('4', 'IOS', 'Programming');
4+
insert into Experiments (experiment_id, platform, experiment_name) values ('13', 'IOS', 'Sports');
5+
insert into Experiments (experiment_id, platform, experiment_name) values ('14', 'Android', 'Reading');
6+
insert into Experiments (experiment_id, platform, experiment_name) values ('8', 'Web', 'Reading');
7+
insert into Experiments (experiment_id, platform, experiment_name) values ('12', 'Web', 'Reading');
8+
insert into Experiments (experiment_id, platform, experiment_name) values ('18', 'Web', 'Programming');

Diff for: ‎problems/countries-you-can-safely-invest-in/README.md

+3
Original file line numberDiff line numberDiff line change
@@ -15,3 +15,6 @@
1515

1616
### Related Topics
1717
[[Database](../../tag/database/README.md)]
18+
19+
### Similar Questions
20+
1. [Average Salary: Departments VS Company](../average-salary-departments-vs-company) (Hard)

0 commit comments

Comments
 (0)