List intersection

Set maths in one line.

sets intersection

Implement `intersect(a: list, b: list) -> list`.

Return sorted unique elements that appear in both lists.

Constraints

0 ≤ len(a), len(b) ≤ 10^5

Example

>>> intersect([1,2,3,4],[3,4,5,6])
[3,4]

8 points ~8 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

set(a) & set(b); then sorted().

Test Results

Press Ctrl+Enter or click Run Tests to execute your code.