add 2000

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2000|[Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_2000.java) ||Easy||
 |1996|[The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1996.java) ||Medium||
 |1995|[Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1995.java) ||Easy||
 |1992|[Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1992.java) ||Medium||

src/main/java/com/fishercoder/solutions/_2000.java

@@ -0,0 +1,22 @@
+package com.fishercoder.solutions;
+
+public class _2000 {
+    public static class Solution1 {
+        public String reversePrefix(String word, char ch) {
+            int end = word.length();
+            for (int i = 0; i < word.length(); i++) {
+                if (word.charAt(i) == ch) {
+                    end = i;
+                    break;
+                }
+            }
+            if (end == word.length()) {
+                return word;
+            }
+            StringBuilder sb = new StringBuilder(word.substring(0, end + 1));
+            sb.reverse();
+            sb.append(word.substring(end + 1));
+            return sb.toString();
+        }
+    }
+}