Skyscraper & Kite
How it works
Find a digit with exactly two candidate cells in each of two rows (or two columns), where one cell from each row shares a column. If that shared cell isn't the digit, its own row forces the digit into the row's other cell — and since the two shared cells can't both be the digit (they share a column), at least one row's *other* cell always ends up holding it. Any cell that can see both of those other cells loses the digit either way.
Try it
Look at Row 1, Column 3, Row 1, Column 9, Row 7, Column 3, and Row 7, Column 7 — two rows (or two columns) where 7 has only two candidates each, with one cell from each line sharing a column (or row). Let's pencil them in, then see why 7 can't survive at cells that see both of the two that *don't* share it.
8
3
5
9
4
6
1
6
5
1
8
7
2
4
3
9
4
9
3
1
6
5
3
9
4
7
6
8
1
2
5
1
6
5
9
2
3
4
7
1
4
5
9
6
3
2
1
4
3
9
5
6
9
6
2
5
3
4
5
4
3
6
8
2
9