DSA 1 - The problem asks to determine the final position of a robot after executing a series of "u" (up) and "D" (down) commands. The robot starts at a position, and moves one step up for each "u" command and one step down for each "D" command. The goal is to return "u" if the robot ends up above the starting position, "D" if it ends up below, and an empty string if it ends up at the starting position. DSA 2 / 3 / 4 were releated to graph and array.