How do you solve Article Views I on LeetCode?

Article Views I (LeetCode #1148) can be solved using Brute Force or Optimal Solution. The optimal approach is Optimal Solution with O(n) time complexity and O(n) space complexity. Key insight: Authors can only view their own articles if their author_id matches their viewer_id.

What is the brute force solution for Article Views I?

The brute force approach for Article Views I is Brute Force, with O(n²) time complexity and O(1) space complexity. In the brute-force approach, we will check each article's views and see if the author is also a viewer. This is straightforward but inefficient, as it requires checking every view for every article. The optimal Optimal Solution approach improves this to O(n).

What algorithm or data structure is used to solve Article Views I?

Article Views I uses the following concepts: Database. The recommended patterns to study are: Hash Map, Array.

What are the interview tips for Article Views I?

Always clarify the requirements before jumping into coding. Think about edge cases, such as no authors viewing their own articles. Practice writing SQL queries to become familiar with syntax and logic.

What are common mistakes when solving Article Views I?

Not using DISTINCT, leading to duplicate author_ids in the result. Forgetting to sort the result set before returning.

#1148

Article Views I

Easy

DatabaseHash MapArray

LeetCode ↗

Approaches

Brute ForceOptimal

Complexity Comparison

	Brute Force	Optimal Solution★
Time	O(n²)	O(n)
Space	O(1)	O(n)

💡

Intuition

Time O(n)Space O(n)

In the optimal solution, we can directly filter the rows where the author is also the viewer in a single pass, making it much more efficient.

⚙️

Algorithm

3 steps

1Step 1: Use a SELECT statement to filter rows where author_id equals viewer_id.
2Step 2: Use DISTINCT to ensure that we only get unique author_ids.
3Step 3: Sort the results by author_id in ascending order.

solution.py4 lines

1SELECT DISTINCT author_id AS id
2FROM Views
3WHERE author_id = viewer_id
4ORDER BY id;

ℹ

Complexity note: The time complexity is O(n) because we only need to scan through the rows once to find matches, and the space complexity is O(n) due to storing unique author_ids.

1Authors can only view their own articles if their author_id matches their viewer_id.
2Using DISTINCT helps in eliminating duplicate entries in the result.

Solutions and explanations are original Tejav content. Problem titles © LeetCode — use the LeetCode button above for the full problem statement.