Count Grid Paths with No Three Equal Moves
Company: SIG (Susquehanna)
Role: Data Scientist
Category: Statistics & Math
Difficulty: easy
Interview Round: Online Assessment
Overview: Count lattice paths from `(0, 0)` to `(5, 5)` that never use three identical directions consecutively. The solution converts paths into alternating runs of length one or two, counts bounded compositions for equal and unequal run totals, and derives 84 valid paths.
Read the full SIG (Susquehanna) Data Scientist interview experience this question came from