On a K-map, two groups are allowed to overlap, sharing one or more cells. A 1 that is covered twice is still just a 1, because ORing a term with itself changes nothing: X + X = X, the idempotent law.
Overlap is often what makes a solution minimal. A 1 that touches two separate areas of 1s can join both groups, letting each be as big as possible. Without overlap, some 1 would be left in a smaller group of its own, giving a longer term.
The classic case is three 1s in an L shape. They can't be one group, but two overlapping pairs that share the corner cell cover them with 2-literal terms.
Overlap has one limit: every group must still earn its place. If all the 1s in a group are already covered by other groups, it is a redundant group and should be removed, even though overlapping it was legal.
Don't-cares can be shared between groups in the same way.
| A\BC | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 0 | 1m0 | 1m1 | 0m3 | 0m2 |
| 1 | 0m4 | 1m5 | 0m7 | 0m6 |