# Execution of All Suffix Instructions Staying in a Grid (LeetCode 2120) Simulate each suffix start; stop at border. ## Approach ```python def executeInstructions(n, startPos, s): def run(i): r,c = startPos steps = 0 for ch in s[i:]: if ch=='L': c-=1 elif ch=='R': c+=1 elif ch=='U': r-=1 else: r+=1 if not (0<=r