add 833 java, progress

Author: yennanliu

README.md

@@ -635,7 +635,7 @@
 824| [Goat Latin](https://leetcode.com/problems/goat-latin/) | [Python](./leetcode_python/String/goat-latin.py) | _O(n + w^2)_ | _O(l)_ | Easy| `string basic`, `fb`| OK
 828| [Count Unique Characters of All Substrings of a Given String](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/) | [Python](./leetcode_python/String/count-unique-characters-of-all-substrings-of-a-given-string.py) | _O(n + w^2)_ | _O(l)_ | Hard| LC 1248, dp, `string`, `amazon`| AGAIN*** (2)
 831| [Masking Personal Information](https://leetcode.com/problems/masking-personal-information/) | [Python](./leetcode_python/String/masking-personal-information.py) | _O(1)_ | _O(1)_ | Medium |`regular expression`| OK* 
-833| [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string/) | [Python](./leetcode_python/String/find-and-replace-in-string.py) | _O(n + m)_ | _O(n)_ | Medium | Union Find | AGAIN (not start)
+833| [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string/) | [Python](./leetcode_python/String/find-and-replace-in-string.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/String/FindAndReplaceInString.java)  | _O(n + m)_ | _O(n)_ | Medium | hashmap, string, google| AGAIN (2) (not start)
 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters/) | [Python](./leetcode_python/String/shifting-letters.py) | _O(n)_ | _O(1)_ | Medium |`remainder`, `basic`| AGAIN**
 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings/) | [Python](./leetcode_python/String/buddy-strings.py) | _O(n)_ | _O(1)_ | Easy || AGAIN*
 880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/) |  [Python](./leetcode_python/String/decoded-string-at-index.py) | _O(n)_ | _O(1)_ | Medium |`trick`| AGAIN (not start**)

data/progress.md

@@ -1,5 +1,8 @@
 # Progress
 
+# 2024-11-16
+- https://github.com/yennanliu/CS_basics/blob/master/doc/Leetcode_company_frequency-master/Google%206months-%20LeetCode.pdf
+
 # 2024-11-15
 - https://github.com/wisdompeak/LeetCode/tree/master?tab=readme-ov-file#two-pointers
 	- (2 pointer, Sliding window)

data/progress.txt

@@ -1,3 +1,4 @@
+20241116: 833
 20241114: 80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)
 20241110: 53,210,207
 20241109: 444

data/to_review.txt

@@ -1,34 +1,37 @@
+2025-01-10 -> ['833']
+2025-01-08 -> ['80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)']
 2025-01-04 -> ['53,210,207']
 2025-01-03 -> ['444']
 2025-01-02 -> ['1188,130,855(again)']
 2024-12-28 -> ['900']
 2024-12-27 -> ['26,27', '802,1197,26']
 2024-12-21 -> ['855,846']
-2024-12-20 -> ['932']
-2024-12-18 -> ['951,792']
+2024-12-20 -> ['833', '932']
+2024-12-18 -> ['80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)', '951,792']
 2024-12-14 -> ['53,210,207', '163,1048']
 2024-12-13 -> ['444', '298,729']
 2024-12-12 -> ['1188,130,855(again)', '1146']
 2024-12-08 -> ['737']
-2024-12-07 -> ['900', '686,734,737']
+2024-12-07 -> ['833', '900', '686,734,737']
 2024-12-06 -> ['26,27', '802,1197,26', '353']
-2024-12-05 -> ['528,334']
+2024-12-05 -> ['80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)', '528,334']
 2024-12-03 -> ['1145']
 2024-12-01 -> ['53,210,207']
 2024-11-30 -> ['444', '855,846', '1145,1219']
-2024-11-29 -> ['1188,130,855(again)', '932']
-2024-11-27 -> ['951,792', '524,221,889']
+2024-11-29 -> ['833', '1188,130,855(again)', '932']
+2024-11-27 -> ['80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)', '951,792', '524,221,889']
 2024-11-26 -> ['743,889']
 2024-11-25 -> ['837']
-2024-11-24 -> ['900']
+2024-11-24 -> ['833', '900']
 2024-11-23 -> ['53,210,207', '26,27', '802,1197,26', '163,1048', '981']
-2024-11-22 -> ['444', '298,729', '1087']
-2024-11-21 -> ['1188,130,855(again)', '1146']
+2024-11-22 -> ['80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)', '444', '298,729', '1087']
+2024-11-21 -> ['833', '1188,130,855(again)', '1146']
 2024-11-20 -> ['939']
-2024-11-18 -> ['53,210,207', '430']
-2024-11-17 -> ['444', '855,846', '737', '363']
-2024-11-16 -> ['1188,130,855(again)', '900', '932', '686,734,737', '1032,844,1011']
-2024-11-15 -> ['53,210,207', '26,27', '802,1197,26', '353', '947']
+2024-11-19 -> ['833', '80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)']
+2024-11-18 -> ['833', '53,210,207', '430']
+2024-11-17 -> ['833', '80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)', '444', '855,846', '737', '363']
+2024-11-16 -> ['80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)', '1188,130,855(again)', '900', '932', '686,734,737', '1032,844,1011']
+2024-11-15 -> ['80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)', '53,210,207', '26,27', '802,1197,26', '353', '947']
 2024-11-14 -> ['444', '951,792', '528,334']
 2024-11-13 -> ['53,210,207', '1188,130,855(again)']
 2024-11-12 -> ['53,210,207', '444', '1145', '753']

leetcode_java/src/main/java/LeetCodeJava/String/FindAndReplaceInString.java

@@ -0,0 +1,113 @@
+package LeetCodeJava.String;
+
+// https://leetcode.com/problems/find-and-replace-in-string/description/
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * 833. Find And Replace in String
+ * Medium
+ * Topics
+ * Companies
+ * You are given a 0-indexed string s that you must perform k replacement operations on. The replacement operations are given as three 0-indexed parallel arrays, indices, sources, and targets, all of length k.
+ * <p>
+ * To complete the ith replacement operation:
+ * <p>
+ * Check if the substring sources[i] occurs at index indices[i] in the original string s.
+ * If it does not occur, do nothing.
+ * Otherwise if it does occur, replace that substring with targets[i].
+ * For example, if s = "abcd", indices[i] = 0, sources[i] = "ab", and targets[i] = "eee", then the result of this replacement will be "eeecd".
+ * <p>
+ * All replacement operations must occur simultaneously, meaning the replacement operations should not affect the indexing of each other. The testcases will be generated such that the replacements will not overlap.
+ * <p>
+ * For example, a testcase with s = "abc", indices = [0, 1], and sources = ["ab","bc"] will not be generated because the "ab" and "bc" replacements overlap.
+ * Return the resulting string after performing all replacement operations on s.
+ * <p>
+ * A substring is a contiguous sequence of characters in a string.
+ * <p>
+ * <p>
+ * <p>
+ * Example 1:
+ * <p>
+ * <p>
+ * Input: s = "abcd", indices = [0, 2], sources = ["a", "cd"], targets = ["eee", "ffff"]
+ * Output: "eeebffff"
+ * Explanation:
+ * "a" occurs at index 0 in s, so we replace it with "eee".
+ * "cd" occurs at index 2 in s, so we replace it with "ffff".
+ * Example 2:
+ * <p>
+ * <p>
+ * Input: s = "abcd", indices = [0, 2], sources = ["ab","ec"], targets = ["eee","ffff"]
+ * Output: "eeecd"
+ * Explanation:
+ * "ab" occurs at index 0 in s, so we replace it with "eee".
+ * "ec" does not occur at index 2 in s, so we do nothing.
+ * <p>
+ * <p>
+ * Constraints:
+ * <p>
+ * 1 <= s.length <= 1000
+ * k == indices.length == sources.length == targets.length
+ * 1 <= k <= 100
+ * 0 <= indexes[i] < s.length
+ * 1 <= sources[i].length, targets[i].length <= 50
+ * s consists of only lowercase English letters.
+ * sources[i] and targets[i] consist of only lowercase English letters.
+ */
+public class FindAndReplaceInString {
+
+    // V0
+//    public String findReplaceString(String s, int[] indices, String[] sources, String[] targets) {
+//
+//    }
+
+    // V1
+    // IDEA : HASHMAP
+    // https://leetcode.com/problems/find-and-replace-in-string/submissions/1454170265/
+    public String findReplaceString_1(String s, int[] indices, String[] sources, String[] targets) {
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int i = 0; i < indices.length; i++) {
+            if (s.startsWith(sources[i], indices[i])) {
+                map.put(indices[i], i);
+            }
+        }
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < s.length(); ) {
+            if (!map.containsKey(i)) {
+                sb.append(s.charAt(i));
+                i++;
+            } else { //replace chars
+                sb.append(targets[map.get(i)]);
+                i += sources[map.get(i)].length();
+            }
+        }
+        return sb.toString();
+    }
+
+    // V2
+    // TODO : replacer `Pair` in code
+    // https://leetcode.com/problems/find-and-replace-in-string/submissions/1454169549/
+//    public String findReplaceString_2(String s, int[] indices, String[] sources, String[] targets) {
+//        Map<Integer , Pair> replacements = new TreeMap<>();
+//        StringBuilder res = new StringBuilder();
+//
+//        for(int i = 0 ; i < indices.length ; i++)
+//            if(s.substring(indices[i]).startsWith(sources[i]))
+//                replacements.put(indices[i] , new Pair(targets[i] , sources[i].length()-1));
+//
+//        for(int i = 0 ; i < s.length() ; i++){
+//            if(replacements.containsKey(i)){
+//                Pair p = replacements.get(i);
+//                res.append(p.getKey());
+//                i += (int)p.getValue();
+//            }
+//            else
+//                res.append(s.charAt(i));
+//        }
+//
+//        return res.toString();
+//    }
+
+}

leetcode_java/src/main/java/dev/workspace5.java

@@ -3182,6 +3182,17 @@ public int maxSubArray(int[] nums) {
         return finalSum;
     }
 
+    // LC 833
+    // https://leetcode.com/problems/find-and-replace-in-string/
+    // 4.23 pm - 4.40 pm
+    public String findReplaceString(String s, int[] indices, String[] sources, String[] targets) {
+
+//        if (sources.length == 1 && targets.length == 1){
+//        }
+
+        return null;
+    }
+
 
 }