Solving DSA Problems. Eolymp 87: Robot
Problem statement
The infinite in both directions stripe with width 1 is divided into blocks of size 1 x 1. In one of these blocks the robot is located. It can move from one cell to another (the robot at the figure is marked with square). Its movemen...
mmzeynalli.hashnode.dev3 min read