Practice Properties Graph
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Properties Graph
Problem Statement
You are given a 2D integer array properties having dimensions n x m and an integer k. Define a function intersect(a, b) that returns the number of distinct integers common to both arrays a and b. Construct an undirected graph where each index i corresponds to properties[i]. There is an edge between node i and node j if and only if intersect(properties[i], properties[j]) >= k, where i and j are in the range [0, n - 1] and i != j. Return the number of connected components in the resulting graph.
Source: Properties Graph on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
properties = [[1,2],[1,1],[3,4],[4,5],[5,6],[7,7]], k = 1
3
# Example 2
properties = [[1,2,3],[2,3,4],[4,3,5]], k = 2
1
# Example 3
properties = [[1,1],[1,1]], k = 2
2
Constraints
Related LeetCode Problems
Practice more problems similar to Properties Graph.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.