2022-03-27 20:37:52 +08:00
< p > Table: < code > ActorDirector< / code > < / p >
< pre >
+-------------+---------+
| Column Name | Type |
+-------------+---------+
| actor_id | int |
| director_id | int |
| timestamp | int |
+-------------+---------+
2023-12-09 18:42:21 +08:00
timestamp is the primary key (column with unique values) for this table.
2022-03-27 20:37:52 +08:00
< / pre >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > Write a solution to find all the pairs < code > (actor_id, director_id)< / code > where the actor has cooperated with the director at least three times.< / p >
2022-03-27 20:37:52 +08:00
< p > Return the result table in < strong > any order< / strong > .< / p >
2023-12-09 18:42:21 +08:00
< p > The result format is in the following example.< / p >
2022-03-27 20:37:52 +08:00
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:37:52 +08:00
< pre >
< strong > Input:< / strong >
ActorDirector table:
+-------------+-------------+-------------+
| actor_id | director_id | timestamp |
+-------------+-------------+-------------+
| 1 | 1 | 0 |
| 1 | 1 | 1 |
| 1 | 1 | 2 |
| 1 | 2 | 3 |
| 1 | 2 | 4 |
| 2 | 1 | 5 |
| 2 | 1 | 6 |
+-------------+-------------+-------------+
< strong > Output:< / strong >
+-------------+-------------+
| actor_id | director_id |
+-------------+-------------+
| 1 | 1 |
+-------------+-------------+
< strong > Explanation:< / strong > The only pair is (1, 1) where they cooperated exactly 3 times.
< / pre >