Coding Challenge · BEGINNER
A small robot moves along a straight path in a warehouse. At each step, it can move either 1 or 2 units forward. Given a total distance n, determine how many distinct ways the robot can reach exactly n units from the start.