Straight Forward, simple C approach.
IntuitionStraight Forward keep count of the distance R indicating positive distance,  L indicating negative distance, lastly _ for either way ("wild card"). Onc
# Intuition
Straight Forward keep count of the distance R indicating positive distance,  L indicating negative distance, lastly _ for either way ("wild card"). Once I have those two values all I have to do is take the abosolute value of the "distance" and add on the wild cards that I call "extra".

# Approach
Initialize my two count variables. Iterate through the string adding up the distance and totaling the wild cards. Once done take the absolute distance and add that to the wild cards. Return it

# Complexity
- Time complexity:
O(N)

- Space complexity:
O(1)

# Code
```c []
int furthestDistanceFromOrigin(char* moves) {

    int distance = 0;
    int extra = 0;

    while (*moves != NULL) {
        (*moves == 'R') && (distance++);
        (*moves == 'L') && (distance--);
        (*moves == '_') && (extra++);
        moves++;
    }
    distance = abs(distance) + extra;

    return distance;
}
```
['C']