Regional Environmental Engineer, AWS Environmental

Amazon

You are given a string moves of length n consisting only of characters 'L', 'R', and '_'. The string represents your movement on a number line starting from the origin 0. In the ith move, you can choose one of the following directions: move to the left if moves[i] = 'L' or moves[i] = '_' move to the right if moves[i] = 'R' or moves[i] = '_' Return the *distance from the origin* of the *furthest* point you can get to after n moves. Example 1: Input: moves = L_RL__R Output: 3 Explanation: The furthest point we can reach from the origin 0 is point -3 through the following sequence of moves LLRLLLR. Example 2: Input: moves = R__LL Output: 5 Explanation: The furthest point we can reach from the origin 0 is point -5 through the following sequence of moves LRLLLLL. Example 3: Input: moves = _ Output: 7 Explanation: The furthest point we can reach from the origin 0 is point 7 through the following sequence of moves RRRRRRR.

Amazon

Design a Chess Board using Object-Oriented principles. Consider the classes, their attributes, and methods. Focus on the core components like the board, pieces, and interactions between them. For example, how would you represent the different chess pieces (pawn, rook, knight, etc.) and their unique movement rules? How would you handle the logic for checking if a move is valid, including considering piece-specific constraints and checking for checkmate or stalemate scenarios? Illustrate with code snippets to showcase how these objects would interact. How will you handle special moves like castling and en passant? How would you keep track of the game state and handle turn management?

Amazon

Describe a time when you and a teammate had a fundamental disagreement about a project. What was the disagreement about? How did you approach resolving the disagreement? What was the outcome, and what did you learn from the experience?