From d080bb94588df4404f2644b9ea7dad82568d7cdb Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Jos=C3=A9=20Antonio=20Chac=C3=B3n=20Guti=C3=A9rrez?= <138903866+joseantoniochacon@users.noreply.github.com> Date: Thu, 27 Jun 2024 10:43:32 -0600 Subject: [PATCH] Create README - LeetHub --- .../README.md | 45 +++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 1050-actors-and-directors-who-cooperated-at-least-three-times/README.md diff --git a/1050-actors-and-directors-who-cooperated-at-least-three-times/README.md b/1050-actors-and-directors-who-cooperated-at-least-three-times/README.md new file mode 100644 index 0000000..635bbb1 --- /dev/null +++ b/1050-actors-and-directors-who-cooperated-at-least-three-times/README.md @@ -0,0 +1,45 @@ +
Table: ActorDirector
+-------------+---------+ +| Column Name | Type | ++-------------+---------+ +| actor_id | int | +| director_id | int | +| timestamp | int | ++-------------+---------+ +timestamp is the primary key (column with unique values) for this table. ++ +
+ +
Write a solution to find all the pairs (actor_id, director_id)
where the actor has cooperated with the director at least three times.
Return the result table in any order.
+ +The result format is in the following example.
+ ++
Example 1:
+ +Input: +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 | ++-------------+-------------+-------------+ +Output: ++-------------+-------------+ +| actor_id | director_id | ++-------------+-------------+ +| 1 | 1 | ++-------------+-------------+ +Explanation: The only pair is (1, 1) where they cooperated exactly 3 times. ++