Find names that appear in both the `students` and `teachers` tables.
Problem Statement
Examples
Input: students table: +---------+ | name | +---------+ | Alice | | Bob | | Charlie | +---------+ teachers table: +---------+ | name | +---------+ | Bob | | Charlie | | Dana | +---------+
Output: +---------+ | name | +---------+ | Bob | | Charlie | +---------+
Explanation: Only records matching the specified criteria are returned in the final result.
Complexity
Time Complexity: -
Space Complexity: -
Hints
Editorial & Approach
Problem Overview & Intuition
To solve "INTERSECT", we query the relational database engine using declarative SQL. The goal is to find names that appear in both the `students` and `teachers` tables. By formulating an optimal execution plan with appropriate projection and filtering, the database engine executes the query with minimal overhead.
Step-by-Step Approach
- Analyze Schema: Identify the target tables, necessary foreign keys, and expected output columns.
- Construct Filtering & Logic: Apply row projections to isolate the requested data.
- Format & Order: Ensure columns match the expected project schema in order.
Optimal Implementation (SQL)
SELECT name FROM students INTERSECT SELECT name FROM teachers;
Complexity Analysis
Key Considerations & Edge Cases
- Empty Tables: The query executes safely returning zero rows without syntax error.
- NULL Values: Columns containing NULL values are properly handled by standard ANSI SQL semantics.
- Case Sensitivity: String comparisons and keywords adhere to PostgreSQL/standard SQL rules.