Skip to content
AlmostSurely
Course Problems
Counting› Clever Counting› 2.3 Recursions
Problem 2.28 ★★★Hard Coming soon

Pairs Differing by 1 or 11

Coming soon for subscribers

This problem and its full worked solution will be part of the AlmostSurely subscription. The free problems are open now, with complete solutions.

Try 2.23 Climbing Stairs One or Two at a Time
Previous2.27 Density of Heads Without HH Next2.29 Domino Tilings of a 3×n Board

Section 2.3

Recursions Toolkit
  1. 2.23Climbing Stairs One or Two at a Time
  2. 2.24Lazy Caterer's Lines
  3. 2.25No Two Consecutive Heads
  4. 2.26Subsets With One Consecutive Pair
  5. 2.27Density of Heads Without HH
  6. 2.28Pairs Differing by 1 or 11
  7. 2.29Domino Tilings of a 3×n Board
  8. 2.30Pairing Gloves With Close Labels
  9. 2.31Sorted by One Bubble-Sort Pass
AlmostSurely

Quant interview problems, taught by technique.

CourseProblemsTermsPrivacy