Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Set Intersection Size At Least Two
Bookmark
Brute Force
Greedy
Explicit Set
Input
Example 1
Example 2
Nested
Disjoint
Custom
intervals
=
[[1,3],[1,4],[2,5],[3,5]]
[1,3]
[1,4]
[2,5]
[3,5]
[1,3]
[1,4]
[2,5]
[3,5]
|S| =
0
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
candidate values:
5
|S| =
2
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
subset #
1
{
1, 2
}
→ one interval holds only
1
|S| =
2
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
subset #
3
{
1, 4
}
→ one interval holds only
1
|S| =
2
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
subset #
5
{
2, 3
}
→ one interval holds only
1
|S| =
2
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
subset #
7
{
2, 5
}
→ one interval holds only
1
|S| =
2
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
subset #
9
{
3, 5
}
→ one interval holds only
1
|S| =
3
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
subset #
11
{
1, 2, 3
}
|S| =
3
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
subset #
13
{
1, 2, 5
}
|S| =
3
[1,3]
[1,4]
[2,5]
[3,5]
1
2
3
4
5
Minimum size =
3
algo
master
.
io
Step:
Start: pick the fewest points so every interval holds at least 2 of them
0 / 36
Input
Example 1
Example 2
Nested
Disjoint
Custom
intervals
=
[[1,3],[1,4],[2,5],[3,5]]
0 / 36
algo
master
.
io
Step:
Start: pick the fewest points so every interval holds at least 2 of them
