Skip to content

Commit bef626f

Browse files
yanglbmeyanglbme
authored
feat: add solutions to lc problem: No.3087 (#2456)
No.3087.Find Trending Hashtags
1 parent 12d929c commit bef626f

10 files changed

+278
-10
lines changed

‎solution/3000-3099/3087.Find Trending Hashtags/README.md

+126
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,126 @@
1+
# [3087. Find Trending Hashtags](https://leetcode.cn/problems/find-trending-hashtags)
2+
3+
[English Version](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README_EN.md)
4+
5+
<!-- tags: -->
6+
7+
## 题目描述
8+
9+
<!-- 这里写题目描述 -->
10+
11+
<p>Table: <code>Tweets</code></p>
12+
13+
<pre>
14+
+-------------+---------+
15+
| Column Name | Type |
16+
+-------------+---------+
17+
| user_id | int |
18+
| tweet_id | int |
19+
| tweet_date | date |
20+
| tweet | varchar |
21+
+-------------+---------+
22+
tweet_id is the primary key (column with unique values) for this table.
23+
Each row of this table contains user_id, tweet_id, tweet_date and tweet.
24+
</pre>
25+
26+
<p>Write a solution to find the <strong>top</strong> <code>3</code> trending <strong>hashtags</strong>&nbsp;in&nbsp;<strong>February</strong> <code>2024</code>.</p>
27+
28+
<p>Return <em>the result table orderd by count of hashtag, hastag in </em><strong>descending</strong><em> order.</em></p>
29+
30+
<p>The result format is in the following example.</p>
31+
32+
<p>&nbsp;</p>
33+
<p><strong class="example">Example 1:</strong></p>
34+
35+
<div class="example-block">
36+
<p><strong>Input:</strong></p>
37+
38+
<p>Tweets table:</p>
39+
40+
<pre class="example-io">
41+
+---------+----------+----------------------------------------------+------------+
42+
| user_id | tweet_id | tweet | tweet_date |
43+
+---------+----------+----------------------------------------------+------------+
44+
| 135 | 13 | Enjoying a great start to the day! #HappyDay | 2024-02-01 |
45+
| 136 | 14 | Another #HappyDay with good vibes! | 2024-02-03 |
46+
| 137 | 15 | Productivity peaks! #WorkLife | 2024-02-04 |
47+
| 138 | 16 | Exploring new tech frontiers. #TechLife | 2024-02-04 |
48+
| 139 | 17 | Gratitude for today&#39;s moments. #HappyDay | 2024-02-05 |
49+
| 140 | 18 | Innovation drives us. #TechLife | 2024-02-07 |
50+
| 141 | 19 | Connecting with nature&#39;s serenity. #Nature | 2024-02-09 |
51+
+---------+----------+----------------------------------------------+------------+
52+
</pre>
53+
54+
<p><strong>Output:</strong></p>
55+
56+
<pre class="example-io">
57+
+-----------+--------------+
58+
| hashtag | hashtag_count|
59+
+-----------+--------------+
60+
| #HappyDay | 3 |
61+
| #TechLife | 2 |
62+
| #WorkLife | 1 |
63+
+-----------+--------------+
64+
65+
</pre>
66+
67+
<p><strong>Explanation:</strong></p>
68+
69+
<ul>
70+
<li><strong>#HappyDay:</strong> Appeared in tweet IDs 13, 14, and 17, with a total count of 3 mentions.</li>
71+
<li><strong>#TechLife:</strong> Appeared in tweet IDs 16 and 18, with a total count of 2 mentions.</li>
72+
<li><strong>#WorkLife:</strong> Appeared in tweet ID 15, with a total count of 1 mention.</li>
73+
</ul>
74+
75+
<p><b>Note:</b> Output table is sorted in descending order by hashtag_count and hashtag respectively.</p>
76+
</div>
77+
78+
## 解法
79+
80+
### 方法一：提取子串 + 分组
81+
82+
我们可以查询得到 2024 年 2 月的所有 tweet，利用 `SUBSTRING_INDEX` 函数提取 Hashtag，然后使用 `GROUP BY` 和 `COUNT` 函数统计每个 Hashtag 出现的次数，最后按照出现次数降序、Hashtag 降序排序，取前三个热门 Hashtag。
83+
84+
<!-- tabs:start -->
85+
86+
```sql
87+
# Write your MySQL query statement below
88+
SELECT
89+
CONCAT('#', SUBSTRING_INDEX(SUBSTRING_INDEX(tweet, '#', -1), ' ', 1)) AS hashtag,
90+
COUNT(1) AS hashtag_count
91+
FROM Tweets
92+
WHERE DATE_FORMAT(tweet_date, '%Y%m') = '202402'
93+
GROUP BY 1
94+
ORDER BY 2 DESC, 1 DESC
95+
LIMIT 3;
96+
```
97+
98+
```python
99+
import pandas as pd
100+
101+
102+
def find_trending_hashtags(tweets: pd.DataFrame) -> pd.DataFrame:
103+
# 过滤数据框以获取特定日期的数据
104+
tweets = tweets[tweets["tweet_date"].dt.strftime("%Y%m") == "202402"]
105+
106+
# 提取 Hashtag
107+
tweets["hashtag"] = "#" + tweets["tweet"].str.extract(r"#(\w+)")
108+
109+
# 统计 Hashtag 出现次数
110+
hashtag_counts = tweets["hashtag"].value_counts().reset_index()
111+
hashtag_counts.columns = ["hashtag", "hashtag_count"]
112+
113+
# 根据出现次数降序排序 Hashtag
114+
hashtag_counts = hashtag_counts.sort_values(
115+
by=["hashtag_count", "hashtag"], ascending=[False, False]
116+
)
117+
118+
# 返回前三个热门 Hashtag
119+
top_3_hashtags = hashtag_counts.head(3)
120+
121+
return top_3_hashtags
122+
```
123+
124+
<!-- tabs:end -->
125+
126+
<!-- end -->

‎solution/3000-3099/3087.Find Trending Hashtags/README_EN.md

+114
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,114 @@
1+
# [3087. Find Trending Hashtags](https://leetcode.com/problems/find-trending-hashtags)
2+
3+
[中文文档](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README.md)
4+
5+
<!-- tags: -->
6+
7+
## Description
8+
9+
<p>Table: <code>Tweets</code></p>
10+
11+
<pre>
12+
+-------------+---------+
13+
| Column Name | Type |
14+
+-------------+---------+
15+
| user_id | int |
16+
| tweet_id | int |
17+
| tweet_date | date |
18+
| tweet | varchar |
19+
+-------------+---------+
20+
tweet_id is the primary key (column with unique values) for this table.
21+
Each row of this table contains user_id, tweet_id, tweet_date and tweet.
22+
</pre>
23+
24+
<p>Write a solution to find the <strong>top</strong> <code>3</code> trending <strong>hashtags</strong>&nbsp;in&nbsp;<strong>February</strong> <code>2024</code>.</p>
25+
26+
<p>Return <em>the result table orderd by count of hashtag, hastag in </em><strong>descending</strong><em> order.</em></p>
27+
28+
<p>The result format is in the following example.</p>
29+
30+
<p>&nbsp;</p>
31+
<p><strong class="example">Example 1:</strong></p>
32+
33+
<div class="example-block">
34+
<p><strong>Input:</strong></p>
35+
36+
<p>Tweets table:</p>
37+
38+
<pre class="example-io">
39+
+---------+----------+----------------------------------------------+------------+
40+
| user_id | tweet_id | tweet | tweet_date |
41+
+---------+----------+----------------------------------------------+------------+
42+
| 135 | 13 | Enjoying a great start to the day! #HappyDay | 2024-02-01 |
43+
| 136 | 14 | Another #HappyDay with good vibes! | 2024-02-03 |
44+
| 137 | 15 | Productivity peaks! #WorkLife | 2024-02-04 |
45+
| 138 | 16 | Exploring new tech frontiers. #TechLife | 2024-02-04 |
46+
| 139 | 17 | Gratitude for today&#39;s moments. #HappyDay | 2024-02-05 |
47+
| 140 | 18 | Innovation drives us. #TechLife | 2024-02-07 |
48+
| 141 | 19 | Connecting with nature&#39;s serenity. #Nature | 2024-02-09 |
49+
+---------+----------+----------------------------------------------+------------+
50+
</pre>
51+
52+
<p><strong>Output:</strong></p>
53+
54+
<pre class="example-io">
55+
+-----------+--------------+
56+
| hashtag | hashtag_count|
57+
+-----------+--------------+
58+
| #HappyDay | 3 |
59+
| #TechLife | 2 |
60+
| #WorkLife | 1 |
61+
+-----------+--------------+
62+
63+
</pre>
64+
65+
<p><strong>Explanation:</strong></p>
66+
67+
<ul>
68+
<li><strong>#HappyDay:</strong> Appeared in tweet IDs 13, 14, and 17, with a total count of 3 mentions.</li>
69+
<li><strong>#TechLife:</strong> Appeared in tweet IDs 16 and 18, with a total count of 2 mentions.</li>
70+
<li><strong>#WorkLife:</strong> Appeared in tweet ID 15, with a total count of 1 mention.</li>
71+
</ul>
72+
73+
<p><b>Note:</b> Output table is sorted in descending order by hashtag_count and hashtag respectively.</p>
74+
</div>
75+
76+
## Solutions
77+
78+
### Solution 1: Extract Substring + Grouping
79+
80+
We can query all tweets from February 2024, use the `SUBSTRING_INDEX` function to extract Hashtags, then use the `GROUP BY` and `COUNT` functions to count the occurrences of each Hashtag. Finally, we sort by the number of occurrences in descending order and by Hashtag in descending order, and take the top three popular Hashtags.
81+
82+
<!-- tabs:start -->
83+
84+
```sql
85+
# Write your MySQL query statement below
86+
SELECT
87+
CONCAT('#', SUBSTRING_INDEX(SUBSTRING_INDEX(tweet, '#', -1), ' ', 1)) AS hashtag,
88+
COUNT(1) AS hashtag_count
89+
FROM Tweets
90+
WHERE DATE_FORMAT(tweet_date, '%Y%m') = '202402'
91+
GROUP BY 1
92+
ORDER BY 2 DESC, 1 DESC
93+
LIMIT 3;
94+
```
95+
96+
```python
97+
import pandas as pd
98+
99+
100+
def find_trending_hashtags(tweets: pd.DataFrame) -> pd.DataFrame:
101+
tweets = tweets[tweets["tweet_date"].dt.strftime("%Y%m") == "202402"]
102+
tweets["hashtag"] = "#" + tweets["tweet"].str.extract(r"#(\w+)")
103+
hashtag_counts = tweets["hashtag"].value_counts().reset_index()
104+
hashtag_counts.columns = ["hashtag", "hashtag_count"]
105+
hashtag_counts = hashtag_counts.sort_values(
106+
by=["hashtag_count", "hashtag"], ascending=[False, False]
107+
)
108+
top_3_hashtags = hashtag_counts.head(3)
109+
return top_3_hashtags
110+
```
111+
112+
<!-- tabs:end -->
113+
114+
<!-- end -->

‎solution/3000-3099/3087.Find Trending Hashtags/Solution.py

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
import pandas as pd
2+
3+
4+
def find_trending_hashtags(tweets: pd.DataFrame) -> pd.DataFrame:
5+
tweets = tweets[tweets["tweet_date"].dt.strftime("%Y%m") == "202402"]
6+
tweets["hashtag"] = "#" + tweets["tweet"].str.extract(r"#(\w+)")
7+
hashtag_counts = tweets["hashtag"].value_counts().reset_index()
8+
hashtag_counts.columns = ["hashtag", "hashtag_count"]
9+
hashtag_counts = hashtag_counts.sort_values(
10+
by=["hashtag_count", "hashtag"], ascending=[False, False]
11+
)
12+
top_3_hashtags = hashtag_counts.head(3)
13+
return top_3_hashtags

‎solution/3000-3099/3087.Find Trending Hashtags/Solution.sql

+9
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
# Write your MySQL query statement below
2+
SELECT
3+
CONCAT('#', SUBSTRING_INDEX(SUBSTRING_INDEX(tweet, '#', -1), ' ', 1)) AS hashtag,
4+
COUNT(1) AS hashtag_count
5+
FROM Tweets
6+
WHERE DATE_FORMAT(tweet_date, '%Y%m') = '202402'
7+
GROUP BY 1
8+
ORDER BY 2 DESC, 1 DESC
9+
LIMIT 3;

‎solution/DATABASE_README.md

+1
Original file line numberDiff line numberDiff line change
@@ -271,6 +271,7 @@
271271
| 3059 | [Find All Unique Email Domains](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README.md) | `数据库` | 简单 | 🔒 |
272272
| 3060 | [User Activities within Time Bounds](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README.md) | `数据库` | 困难 | 🔒 |
273273
| 3061 | [计算滞留雨水](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README.md) | `数据库` | 困难 | 🔒 |
274+
| 3087 | [Find Trending Hashtags](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README.md) | | 中等 | 🔒 |
274275

275276
## 版权
276277

‎solution/DATABASE_README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -269,6 +269,7 @@ Press <kbd>Control</kbd> + <kbd>F</kbd>(or <kbd>Command</kbd> + <kbd>F</kbd> on
269269
| 3059 | [Find All Unique Email Domains](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README_EN.md) | `Database` | Easy | 🔒 |
270270
| 3060 | [User Activities within Time Bounds](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README_EN.md) | `Database` | Hard | 🔒 |
271271
| 3061 | [Calculate Trapping Rain Water](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README_EN.md) | `Database` | Hard | 🔒 |
272+
| 3087 | [Find Trending Hashtags](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README_EN.md) | | Medium | 🔒 |
272273

273274
## Copyright
274275

‎solution/README.md

+6-5
Original file line numberDiff line numberDiff line change
@@ -3083,11 +3083,11 @@
30833083
| 3070 | [元素和小于等于 k 的子矩阵的数目](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 387 场周赛 |
30843084
| 3071 | [在矩阵上写出字母 Y 所需的最少操作次数](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README.md) | `数组`,`哈希表`,`计数`,`矩阵` | 中等 | 第 387 场周赛 |
30853085
| 3072 | [将元素分配到两个数组中 II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README.md) | `树状数组`,`线段树`,`数组`,`模拟` | 困难 | 第 387 场周赛 |
3086-
| 3073 | [最大递增三元组](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README.md) | | 中等 | 🔒 |
3087-
| 3074 | [重新分装苹果](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README.md) | | 简单 | 第 388 场周赛 |
3088-
| 3075 | [幸福值最大化的选择方案](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README.md) | | 中等 | 第 388 场周赛 |
3089-
| 3076 | [数组中的最短非公共子字符串](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README.md) | | 中等 | 第 388 场周赛 |
3090-
| 3077 | [K 个不相交子数组的最大能量值](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README.md) | | 困难 | 第 388 场周赛 |
3086+
| 3073 | [最大递增三元组](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README.md) | `数组`,`有序集合` | 中等 | 🔒 |
3087+
| 3074 | [重新分装苹果](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 388 场周赛 |
3088+
| 3075 | [幸福值最大化的选择方案](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 388 场周赛 |
3089+
| 3076 | [数组中的最短非公共子字符串](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | 第 388 场周赛 |
3090+
| 3077 | [K 个不相交子数组的最大能量值](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README.md) | `数组`,`动态规划`,`前缀和` | 困难 | 第 388 场周赛 |
30913091
| 3078 | [Match Alphanumerical Pattern in Matrix I](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README.md) | | 中等 | 🔒 |
30923092
| 3079 | [求出加密整数的和](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README.md) | | 简单 | 第 126 场双周赛 |
30933093
| 3080 | [执行操作标记数组中的元素](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README.md) | | 中等 | 第 126 场双周赛 |
@@ -3097,6 +3097,7 @@
30973097
| 3084 | [统计以给定字符开头和结尾的子字符串总数](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README.md) | | 中等 | 第 389 场周赛 |
30983098
| 3085 | [成为 K 特殊字符串需要删除的最少字符数](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README.md) | | 中等 | 第 389 场周赛 |
30993099
| 3086 | [拾起 K 个 1 需要的最少行动次数](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README.md) | | 困难 | 第 389 场周赛 |
3100+
| 3087 | [Find Trending Hashtags](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README.md) | | 中等 | 🔒 |
31003101

31013102
## 版权
31023103

‎solution/README_EN.md

+6-5
Original file line numberDiff line numberDiff line change
@@ -3081,11 +3081,11 @@ Press <kbd>Control</kbd> + <kbd>F</kbd>(or <kbd>Command</kbd> + <kbd>F</kbd> on
30813081
| 3070 | [Count Submatrices with Top-Left Element and Sum Less Than k](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 387 |
30823082
| 3071 | [Minimum Operations to Write the Letter Y on a Grid](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Matrix` | Medium | Weekly Contest 387 |
30833083
| 3072 | [Distribute Elements Into Two Arrays II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Simulation` | Hard | Weekly Contest 387 |
3084-
| 3073 | [Maximum Increasing Triplet Value](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README_EN.md) | | Medium | 🔒 |
3085-
| 3074 | [Apple Redistribution into Boxes](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README_EN.md) | | Easy | Weekly Contest 388 |
3086-
| 3075 | [Maximize Happiness of Selected Children](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README_EN.md) | | Medium | Weekly Contest 388 |
3087-
| 3076 | [Shortest Uncommon Substring in an Array](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README_EN.md) | | Medium | Weekly Contest 388 |
3088-
| 3077 | [Maximum Strength of K Disjoint Subarrays](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README_EN.md) | | Hard | Weekly Contest 388 |
3084+
| 3073 | [Maximum Increasing Triplet Value](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README_EN.md) | `Array`,`Ordered Set` | Medium | 🔒 |
3085+
| 3074 | [Apple Redistribution into Boxes](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 388 |
3086+
| 3075 | [Maximize Happiness of Selected Children](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 388 |
3087+
| 3076 | [Shortest Uncommon Substring in an Array](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 388 |
3088+
| 3077 | [Maximum Strength of K Disjoint Subarrays](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 388 |
30893089
| 3078 | [Match Alphanumerical Pattern in Matrix I](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README_EN.md) | | Medium | 🔒 |
30903090
| 3079 | [Find the Sum of Encrypted Integers](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README_EN.md) | | Easy | Biweekly Contest 126 |
30913091
| 3080 | [Mark Elements on Array by Performing Queries](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README_EN.md) | | Medium | Biweekly Contest 126 |
@@ -3095,6 +3095,7 @@ Press <kbd>Control</kbd> + <kbd>F</kbd>(or <kbd>Command</kbd> + <kbd>F</kbd> on
30953095
| 3084 | [Count Substrings Starting and Ending with Given Character](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README_EN.md) | | Medium | Weekly Contest 389 |
30963096
| 3085 | [Minimum Deletions to Make String K-Special](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README_EN.md) | | Medium | Weekly Contest 389 |
30973097
| 3086 | [Minimum Moves to Pick K Ones](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README_EN.md) | | Hard | Weekly Contest 389 |
3098+
| 3087 | [Find Trending Hashtags](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README_EN.md) | | Medium | 🔒 |
30983099

30993100
## Copyright
31003101

‎solution/database-summary.md

+1
Original file line numberDiff line numberDiff line change
@@ -261,3 +261,4 @@
261261
- [3059.Find All Unique Email Domains](/database-solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README.md)
262262
- [3060.User Activities within Time Bounds](/database-solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README.md)
263263
- [3061.计算滞留雨水](/database-solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README.md)
264+
- [3087.Find Trending Hashtags](/database-solution/3000-3099/3087.Find%20Trending%20Hashtags/README.md)

0 commit comments

Comments
 (0)