solves reverse prefix of word

Author: anishLearnsToCode

Diff for: README.md

@@ -478,7 +478,7 @@
 | 1984 | [Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores)      |                                                [![Java](assets/java.png)](src/MinimumDifferenceBetweenHighestAndLowestOfKScores.java)                                                |                                                                                                                                   |
 | 1991 | [Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array)                                                            |                                                            [![Java](assets/java.png)](src/FindTheMiddleIndexInArray.java)                                                            |                                                                                                                                   |
 | 1995 | [Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets)                                                                      |                                                             [![Java](assets/java.png)](src/CountSpecialQuadruplets.java)                                                             |                                                                                                                                   |
-| 2000 | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word)                                                                            |                                                                                                                                                                                      |                                                                                                                                   |
+| 2000 | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word)                                                                            |                                                               [![Java](assets/java.png)](src/ReversePrefixOfWord.java)                                                               |                                                                                                                                   |
 | 2006 | [Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k)                        |                                                                                                                                                                                      |                                                                                                                                   |
 | 2011 | [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations)                  |                                                                                                                                                                                      |                                                                                                                                   |
 | 2016 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements)                            |                                                                                                                                                                                      |                                                                                                                                   |

Diff for: src/ReversePrefixOfWord.java

@@ -0,0 +1,19 @@
+// https://leetcode.com/problems/reverse-prefix-of-word
+// T: O(|word|)
+// S: O(|word|)
+
+public class ReversePrefixOfWord {
+    public String reversePrefix(String word, char ch) {
+        final StringBuilder result = new StringBuilder();
+        boolean encounteredChar = false;
+        for (int i = 0 ; i < word.length() ; i++) {
+            if (!encounteredChar && word.charAt(i) == ch) {
+                result.append(word.charAt(i)).reverse();
+                encounteredChar = true;
+            } else {
+                result.append(word.charAt(i));
+            }
+        }
+        return result.toString();
+    }
+}