Find the Subtasks That Did Not Execute — LeetCode 1767 Python Solution
HardLeetCode PremiumDatabase
- Problem
- #1767
- Reading time
- 5 min
- Source
- leetcode.com
Table schema
SQL
Table: Tasks +----------------+---------+ | Column Name | Type | +----------------+---------+ | task_id | int | | subtasks_count | int | +----------------+---------+ task_id is the column with unique values for this table. Each row in this table indicates that task_id was divided into subtasks_count subtasks labeled from 1 to subtasks_count.Example
SQL
+----------------+---------+
| Column Name | Type |
+----------------+---------+
| task_id | int |
| subtasks_count | int |
+----------------+---------+
task_id is the column with unique values for this table.
Each row in this table indicates that task_id was divided into subtasks_count subtasks labeled from 1 to subtasks_count.
It is guaranteed that 2 <= subtasks_count <= 20.Python solution
Python
import duckdb
import pandas as pd
def solution(tasks: pd.DataFrame, executed: pd.DataFrame) -> pd.DataFrame:
con = duckdb.connect()
con.register("Tasks", tasks)
con.register("Executed", executed)
return con.execute("""WITH RECURSIVE
T(task_id, subtask_id) AS (
SELECT
task_id,
subtasks_count
FROM Tasks
UNION ALL
SELECT
task_id,
subtask_id - 1
FROM t
WHERE subtask_id > 1
)
SELECT
T.*
FROM
T
LEFT JOIN Executed USING (task_id, subtask_id)
WHERE Executed.subtask_id IS NULL;""").df()Complexity
| Measure | Complexity |
|---|---|
| Time | O(n log n) (typical) |
| Space | O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 1767. Find the Subtasks That Did Not Execute?
- LeetCode 1767. Find the Subtasks That Did Not Execute is rated Hard on LeetCode.
- What topics does LeetCode 1767. Find the Subtasks That Did Not Execute cover?
- LeetCode 1767. Find the Subtasks That Did Not Execute is tagged Database on LeetCode.
- Is LeetCode 1767. Find the Subtasks That Did Not Execute a premium problem?
- Yes. LeetCode 1767. Find the Subtasks That Did Not Execute is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.