hard · GMAT Quant
A courier on a city grid starts at (0,0) and must reach (2,2), moving only East or North. The courier is prohibited from visiting the point (1,0).
How many distinct shortest paths remain?
- 4
- 5
- 6
- 3
- 2
Sign up free to see the explanation and track your rank →
More GMAT Quant practice
- Including both endpoints, how many distinct integer price points are in this range?
- Which of the following expressions must result in a positive value?
- Which property of arithmetic justifies that first step?
- Which of the following must also be an even integer?
- Which of the following inequalities correctly represents this range?
- Which of the following includes the number 0?
- How many unique meal combinations can a customer create?
- What is the probability that the lightbulb is functional?