Robot Return to Origin LEETCODE PRACTISE (05 APRIL 2026)

⭐ IN THE GIVEN PROBLEM, HERE WE HAVE A ROBOT AT THE ORIGIN AT 2D PLANE, WITH SOME MOVES AS IN STRING. ⭐ WE NEED TO PERFORM ALL THOSE MOVES TAKEN BY THE ROBOT, AND RETURN THE RESULT AS TRUE, IF IT IS AT THEIR ORIGIN ELSE FALSE. ⭐ FOR THAT FIRST WE DEFINE THE CORDINATES FOR THE ROBOTS LET SAY X =0, Y=0; ⭐ THEN BASED ON THE MOVEMENT, WE CHECK THE CONDTION, IF ITS FINAL DESTINATION IS AT ORIGIN AFTER PERFORMING ALL THE MOVEMENT, THEN RETURN TRUE, ELSE RETURN FALSE. ⭐ TIME COMPLEXITY; O(n), AS WE MOVE THROUGH OUT N TIMES. ⭐ SPACE COMPLEXITY: O(1), AS WE DON'T USE ANY EXTRA SPACE HERE...