add 3114

Author: fishercoder1534

Diff for: paginated_contents/algorithms/4th_thousand/README.md

@@ -45,6 +45,7 @@
 | 3131 | [Find the Integer Added to Array I](https://leetcode.com/problems/find-the-integer-added-to-array-i/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3131.java) |                                                                               | Easy       |
 | 3127 | [Make a Square with the Same Color](https://leetcode.com/problems/make-a-square-with-the-same-color/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3127.java) |                                                                               | Easy       |
 | 3120 | [Count the Number of Special Characters I](https://leetcode.com/problems/count-the-number-of-special-characters-i/)                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3120.java) |                                                                               | Easy       |
+| 3114 | [Latest Time You Can Obtain After Replacing Characters](https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3114.java) |                                                                               | Easy       | 
 | 3112 | [Minimum Time to Visit Disappearing Nodes](https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3112.java) |                                                                               | Medium     | Graph, Shortest Path
 | 3110 | [Score of a String](https://leetcode.com/problems/score-of-a-string/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3110.java) |                                                                               | Easy       |
 | 3095 | [Shortest Subarray With OR at Least K I](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i/)                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3095.java) |                                                                               | Easy       |

Diff for: src/main/java/com/fishercoder/solutions/fourththousand/_3114.java

@@ -0,0 +1,30 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3114 {
+    public static class Solution1 {
+        public String findLatestTime(String s) {
+            char[] arr = s.toCharArray();
+            if (arr[0] == '?') {
+                if (arr[1] == '?' || arr[1] == '0' || arr[1] == '1') {
+                    arr[0] = '1';
+                } else {
+                    arr[0] = '0';
+                }
+            }
+            if (arr[1] == '?') {
+                if (arr[0] == '1') {
+                    arr[1] = '1';
+                } else {
+                    arr[1] = '9';
+                }
+            }
+            if (arr[3] == '?') {
+                arr[3] = '5';
+            }
+            if (arr[4] == '?') {
+                arr[4] = '9';
+            }
+            return new String(arr);
+        }
+    }
+}