Count Matrix Paths Through Ordered Checkpoints
Problem statement
Start at (rows-1,0) and finish at (rows-1,columns-1). Every move advances one column and changes the row by -1, 0, or +1 while remaining in bounds.
The problem statement continues
ProExamples
Example 1
rows = 3columns = 4checkpoints = [[1,1],[2,3]]return = 2Two choices reach the first checkpoint and two more steps finish at the required endpoint.
FastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week