{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"livecodebench","formal_name":"LiveCodeBench","introduction":"LiveCodeBench continuously collects new competitive-programming problems to evaluate coding capabilities. Its initial release_v1 contains 400 problems, with source platform, contest date, and dataset version tracked explicitly.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://livecodebench.github.io/","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"d9e3ae92-061c-53b9-97ae-68570b84ae2c","task_key":"release~5fv1--test--3019","task_revision_id":"2","upstream_id":"3019","short_description":"furthest-point-from-origin","config":"release_v1","split":"test","body":"{\"contest_date\":\"2023-08-27T00:00:00\",\"contest_id\":\"weekly-contest-360\",\"difficulty\":\"easy\",\"platform\":\"leetcode\",\"question_content\":\"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.\\nIn the i^th move, you can choose one of the following directions:\\n\\nmove to the left if moves[i] = 'L' or moves[i] = '_'\\nmove to the right if moves[i] = 'R' or moves[i] = '_'\\n\\nReturn the distance from the origin of the furthest point you can get to after n moves.\\n \\nExample 1:\\n\\nInput: moves = \\\"L_RL__R\\\"\\nOutput: 3\\nExplanation: The furthest point we can reach from the origin 0 is point -3 through the following sequence of moves \\\"LLRLLLR\\\".\\n\\nExample 2:\\n\\nInput: moves = \\\"_R__LL_\\\"\\nOutput: 5\\nExplanation: The furthest point we can reach from the origin 0 is point -5 through the following sequence of moves \\\"LRLLLLL\\\".\\n\\nExample 3:\\n\\nInput: moves = \\\"_______\\\"\\nOutput: 7\\nExplanation: The furthest point we can reach from the origin 0 is point 7 through the following sequence of moves \\\"RRRRRRR\\\".\\n\\n \\nConstraints:\\n\\n1 <= moves.length == n <= 50\\nmoves consists only of characters 'L', 'R' and '_'.\",\"question_title\":\"furthest-point-from-origin\",\"starter_code\":\"class Solution:\\n    def furthestDistanceFromOrigin(self, moves: str) -> int:\\n        \"}","display_format":"text","language":"","answer_status":"external_grader","assets":[],"source_url":"https://livecodebench.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}