Carrobot Rectangle Path

Problem Statement

Carrobot Rectangle Path Problem Description In this task, we are considering a robot ("Carrobot") drawing shapes on a coordinate plane. Initially, the robot is positioned at a certain starting point on this plane. The robot makes moves based on a provided string, where each character represents a step of equal length in one of the 4 cardinal directions. The mapping for the moves involves the following characters: ^ ("Carrot" / Caret sign): Denotes a move to the North. > (Greater than sign): Denotes a move to the East. v (Lowercase letter v): Denotes a move to the South. v . You can assume that the robot never visits the same point twice, except for the starting point which may be visited at the start and end of the robot's path (forming a closed loop).