#2833 - Furthest Point From Origin

Easy • View on LeetCode • View on GitHub

String Counting

Problem Description

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.

Solution

/**
 * @param {string} moves
 * @return {number}
 */
var furthestDistanceFromOrigin = function(moves) {
  let leftCount = 0;
  let rightCount = 0;
  let wildCount = 0;

  for (const move of moves) {
    if (move === 'L') leftCount++;
    else if (move === 'R') rightCount++;
    else wildCount++;
  }

  return Math.abs(leftCount - rightCount) + wildCount;
};