Circular Move Problem Statement

You have a robot currently positioned at the origin (0, 0) on a two-dimensional grid, facing the north direction. You are given a sequence of moves in the form of a string of length 'N'. Determine whether the robot's movement path is circular, meaning the robot ends up at the starting position.

Example:

Input:

T = 2
Test case 1: 'GLGLGLG'
Test case 2: 'GLGR'

Output:

True
False

Explanation:

A move sequence is circular if the robot returns to the starting point.

Constraints:

• 1 ≤ T ≤ 100
• 0 ≤ N ≤ 10^4
• The sequence will only consist of characters: 'L', 'R', 'G'.