add 2833

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -7,6 +7,7 @@
 | 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2942.java)                                       |                                      | Easy                                     |
 | 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2937.java)                                       |                                      | Easy                                     |
 | 2864 | [Maximum Odd Binary Number](https://leetcode.com/problems/maximum-odd-binary-number/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2864.java)                                       |                                      | Easy                                     |Greedy
+| 2833 | [Furthest Point From Origin](https://leetcode.com/problems/furthest-point-from-origin/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2833.java)                                       |                                      | Easy                                     |
 | 2828 | [Check if a String Is an Acronym of Words](https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2828.java)                                       |                                      | Easy                                     |
 | 2824 | [Count Pairs Whose Sum is Less than Target](https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2824.java)                                       |                                      | Easy                                     |
 | 2815 | [Max Pair Sum in an Array](https://leetcode.com/problems/max-pair-sum-in-an-array/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2815.java)                                       |                                      | Easy                                     |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2833.java

@@ -0,0 +1,20 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2833 {
+    public static class Solution1 {
+        public int furthestDistanceFromOrigin(String moves) {
+            int count = 0;
+            int any = 0;
+            for (char c : moves.toCharArray()) {
+                if (c == 'L') {
+                    count++;
+                } else if (c == 'R') {
+                    count--;
+                } else {
+                    any++;
+                }
+            }
+            return Math.abs(count) + any;
+        }
+    }
+}