Overview

Interview problems that require recursive enumeration, constraint satisfaction, and backtracking search.

• Screen Pattern Lock — Count all distinct unlock patterns on an R x C dot grid under various adjacency rules.
• Plant Flowers in Neighborhood — Place flowers adjacent to houses on a grid satisfying row and column constraints.
• Vegetable Garden — Arrange crop types in a garden grid so that each type forms a single connected patch.