Best Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```dart []\nclass Solution {\n  int furthestDistanceFromOrigin(String moves) {\n    int left = 0;\n    int right = 0;\n    int underScore = 0;\n    for(int i = 0;i<moves.length;i++){\n        if(moves[i] == "L"){\n            left++;\n        }\n        else if(moves[i] == "R"){\n            right++;\n        }\n        else if(moves[i] =="_"){\n            underScore++;\n        }\n    }\n    int furthest = (left - right).abs() + underScore;\n    return furthest;\n  }\n}\n```
['Dart']