Can You Solve One of the Easiest Math Coding Question?
Can You Solve One of the Easiest Math Coding Question?
.
LeetCode 657. Robot Return to Origin
There is a robot starting at the position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.
You are given a string moves that represents the move sequence of the robot where moves[i] represents its ith move. Valid moves are 'R' (right), 'L' (left), 'U' (up), and 'D' (down).
Return true if the robot returns to the origin after it finishes all of its moves, or false otherwise.
.
Time Complexity = O(n), where 'n' is the length of the input array
Space Complexity = O(1)
.
Follow 👉 @the_david_jiang for more tips and tricks to pass your next technical interview!
.
Follow 👉 @the_david_jiang
Follow 👉 @the_david_jiang
Follow 👉 @the_david_jiang
.
My name is David and I am a software engineer at Meta. My passion is teaching software devs how to pass the grueling technical interviews to help them land their 6-figure dream tech job.
I have received 3 six-figure offers from Google, Meta, and Amazon.
.
.
#programming #coding #softwareengineer #softwaredeveloper #computerscience #code #programmer #studentprogrammer #collegestudents #careerintech #developer #coder #java #python #webdeveloper #javascript #code #apple #engineering #students #programmingmemes #google #amazon #meta #microsoft