FastPrepFastPrep
Problem Brief

Get Max Deletions

INTERNOA

A control device has 4 buttons that can be used to move a character around a screen in 4 directions: Up (U), Down (D), Left (L), and Right (R). The movement needs to be optimized by deleting unnecessary instructions while maintaining the same destination. Given the original set of instructions, what is the maximum number of instructions that can be deleted and still have the character reach the destination?

Note: The instructions that are deleted do not need to be contiguous.

Function Description

Complete the function getMaxDeletions in the editor below.

getMaxDeletions has the following parameter:

  1. string S: the original instructions that were programmed

Returns

int: the maximum number of instructions that can be deleted from S while maintaining the destination

𓍯𓂃ᥫ᭡.Credit to chizzy_electᵕ̈𓏧🧡

1Example 1

Input
S = "URDR"
Output
2
Explanation
Example 1 illustration
Given an original set of instructions S = 'URDR', the final destination is 2 units to the right of the initial position after the character moves up, right, down, and right. If 'U' and 'D' are deleted, the destination remains the same. The answer 2 will be returned.

2Example 2

Input
S = "RRR"
Output
0
Explanation
Example 2 illustration
There is nothing that can be deleted from these instructions, so the answer is 0.

Constraints

Limits and guarantees your solution can rely on.

  • 1 ≤ n ≤ 10^5
  • S contains only the characters 'U', 'D', 'L', and 'R'.
    • public int getMaxDeletions(String S) {
  // write your code here
}
    Input

    S

    "URDR"

    Output

    2

    Sign in to submit your solution.