update 43 java

Author: yennanliu

README.md

@@ -580,7 +580,7 @@
 014| [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) |  [Python](./leetcode_python/String/longest-common-prefix.py)  | _O(n * k)_   | _O(1)_  | Easy   |`good basic`| OK* 
 028| [Implement strStr()](https://leetcode.com/problems/implement-strstr/) |  [Python](./leetcode_python/String/implement-strstr.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/String/FindTheIndexOfTheFirstOccurrenceInString.java)  | _O(n + k)_   | _O(k)_  | Easy  | `KMP Algorithm`, `fb` | OK (3) 
 038| [Count and Say](https://leetcode.com/problems/count-and-say/) | [Python](./leetcode_python/String/count-and-say.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/String/CountAndSay.java) | _O(n * 2^n)_  | _O(2^n)_ | Medium | `recursion`, `iteration`, basic, `fb`| AGAIN*********** (5)
-043| [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | [Python](./leetcode_python/String/multiply-strings.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/String/MultiplyStrings.java) | _O(m * n)_ | _O(m + n)_  | Medium |`twitter`, `fb`| AGAIN*** (3) 
+43| [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | [Python](./leetcode_python/String/multiply-strings.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/String/MultiplyStrings.java) | _O(m * n)_ | _O(m + n)_  | Medium |`twitter`, `fb`| AGAIN*** (3) 
 058| [Length of Last Word](https://leetcode.com/problems/length-of-last-word/) | [Python](./leetcode_python/String/length-of-last-word.py)  | _O(n)_   | _O(1)_  | Easy       || OK 
 067| [Add Binary](https://leetcode.com/problems/add-binary/)    | [Python](./leetcode_python/String/add-binary.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/String/AddBinary.java) | _O(n)_  | _O(1)_   | Easy   | bit op, `good basic`, `fb`, `amazon`| OK***** (7) (but again)
 076| [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)    | [Python](./leetcode_python/String/minimum_window_substring.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/String/MinimumWindowSubstring.java)  |  |   | Hard   |`Curated Top 75` | AGAIN******* (2) (not start)
@@ -855,7 +855,7 @@
 
 |  #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Tag, Note        | Status| 
 |-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------|-----|
-033| [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Python](./leetcode_python/Binary_Search/search-in-rotated-sorted-array.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/BinarySearch/SearchInRotatedSortedArray.java) ||| Medium |Curated Top 75, `binary search`,`good basic` ,check `# 81 Search in Rotated Sorted Array II`, binary search, rotation array, `UBER`,`amazon`,`fb`| AGAIN************ (6) (MUST)
+33| [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Python](./leetcode_python/Binary_Search/search-in-rotated-sorted-array.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/BinarySearch/SearchInRotatedSortedArray.java) ||| Medium |Curated Top 75, `binary search`,`good basic` ,check `# 81 Search in Rotated Sorted Array II`, binary search, rotation array, `UBER`,`amazon`,`fb`| AGAIN************ (6) (MUST)
 034 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)| [Python](./leetcode_python/Binary_Search/find-first-and-last-position-of-element-in-sorted-array.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/BinarySearch/FindFirstAndLastPositionOfElementInSortedArray.java)| _O(n)_ | _O(1)_ | Medium | binary search, LC top 100 like, `amazon`, `fb`, google, apple, uber | AGAIN************** (4) (MUST)
 034| [Search for a Range](https://leetcode.com/problems/search-for-a-range/) |[Python](./leetcode_python/Binary_Search/search-for-a-range.py) | _O(logn)_ | _O(1)_   | Medium  || AGAIN* 
 035| [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Python](./leetcode_python/Binary_Search/search-insert-position.py) | _O(logn)_ | _O(1)_   | Medium      || AGAIN 

data/progress.txt

@@ -1,4 +1,4 @@
-20250110: 752,117,116
+20250110: 752,117,116,43(again),714
 20250109: 279,904
 20250108: 852,692
 20250107: 247

data/to_review.txt

@@ -1,4 +1,4 @@
-2025-03-06 -> ['752,117']
+2025-03-06 -> ['752,117,116,43(again),714']
 2025-03-05 -> ['279,904']
 2025-03-04 -> ['852,692']
 2025-03-03 -> ['247']
@@ -11,7 +11,7 @@
 2025-02-20 -> ['079,212(todo),362,849']
 2025-02-15 -> ['369,311']
 2025-02-14 -> ['370']
-2025-02-13 -> ['752,117', '815,871,593,1109']
+2025-02-13 -> ['752,117,116,43(again),714', '815,871,593,1109']
 2025-02-12 -> ['279,904']
 2025-02-11 -> ['852,692']
 2025-02-10 -> ['247']
@@ -20,26 +20,26 @@
 2025-02-04 -> ['729,731']
 2025-02-03 -> ['769,817,855(again)']
 2025-02-01 -> ['498(again),934', '304,853,325']
-2025-01-31 -> ['752,117', '379,173']
+2025-01-31 -> ['752,117,116,43(again),714', '379,173']
 2025-01-30 -> ['279,904', '079,212(todo),362,849']
 2025-01-29 -> ['852,692']
 2025-01-28 -> ['247']
 2025-01-26 -> ['399,1091', '370(todo)']
 2025-01-25 -> ['1031,369', '369,311']
 2025-01-24 -> ['370', '34,767']
-2025-01-23 -> ['752,117', '815,871,593,1109']
+2025-01-23 -> ['752,117,116,43(again),714', '815,871,593,1109']
 2025-01-22 -> ['279,904', '729,731']
 2025-01-21 -> ['852,692', '769,817,855(again)']
 2025-01-20 -> ['247', '722,380']
 2025-01-19 -> ['498(again),934', '33,81']
-2025-01-18 -> ['752,117', '399,1091', '379,173']
+2025-01-18 -> ['752,117,116,43(again),714', '399,1091', '379,173']
 2025-01-17 -> ['279,904', '1031,369', '079,212(todo),362,849', '560,523', '253']
 2025-01-16 -> ['852,692', '776,31']
-2025-01-15 -> ['752,117', '247', '004(todo),34(todo),162(todo),275(todo)']
+2025-01-15 -> ['752,117,116,43(again),714', '247', '004(todo),34(todo),162(todo),275(todo)']
 2025-01-14 -> ['279,904', '729,731', '986(todo),1229(todo),1868(todo),80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)']
-2025-01-13 -> ['752,117', '852,692', '399,1091', '769,817,855(again)']
-2025-01-12 -> ['752,117', '279,904', '247', '1031,369', '369,311']
-2025-01-11 -> ['752,117', '279,904', '852,692', '498(again),934', '370', '304,853,325', '394']
+2025-01-13 -> ['752,117,116,43(again),714', '852,692', '399,1091', '769,817,855(again)']
+2025-01-12 -> ['752,117,116,43(again),714', '279,904', '247', '1031,369', '369,311']
+2025-01-11 -> ['752,117,116,43(again),714', '279,904', '852,692', '498(again),934', '370', '304,853,325', '394']
 2025-01-10 -> ['279,904', '852,692', '247', '399,1091', '379,173', '815,871,593,1109', '833,950']
 2025-01-09 -> ['852,692', '247', '1031,369', '729,731', '079,212(todo),362,849']
 2025-01-08 -> ['247', '399,1091', '769,817,855(again)']

leetcode_java/src/main/java/LeetCodeJava/Recursion/PopulatingNextRightPointersInEachNode2.java

@@ -146,7 +146,7 @@ public Node connect_1(Node root) {
     // https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/solutions/2033511/3-approaches-bfs-bfs-linkedlist-recursio-0q68/
 
     // V2-2
-    // IDEA: BFS + LINKEDLIST
+    // IDEA: BFS + LINKED LIST
     // https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/solutions/2033511/3-approaches-bfs-bfs-linkedlist-recursio-0q68/
 
     // V2-3

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

@@ -13,7 +13,36 @@
  *      989. Add to Array-Form of Integer
  *
  */
-
+/**
+ * 43. Multiply Strings
+ * Solved
+ * Medium
+ * Topics
+ * Companies
+ * Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
+ *
+ * Note: You must not use any built-in BigInteger library or convert the inputs to integer directly.
+ *
+ *
+ *
+ * Example 1:
+ *
+ * Input: num1 = "2", num2 = "3"
+ * Output: "6"
+ * Example 2:
+ *
+ * Input: num1 = "123", num2 = "456"
+ * Output: "56088"
+ *
+ *
+ * Constraints:
+ *
+ * 1 <= num1.length, num2.length <= 200
+ * num1 and num2 consist of digits only.
+ * Both num1 and num2 do not contain any leading zero, except the number 0 itself.
+ *
+ *
+ */
 public class MultiplyStrings {
 
     // V0

leetcode_java/src/main/java/dev/workspace6.java

@@ -2702,6 +2702,77 @@ public Node connect(Node root) {
         }
     }
 
+  // LC 43
+  // https://leetcode.com/problems/multiply-strings/
+  // 6.46 pm - 7.20 pm
+  /**
+   * Example 1:
+   *
+   * Input: num1 = "2", num2 = "3"
+   * Output: "6"
+   * Example 2:
+   *
+   * Input: num1 = "123", num2 = "456"
+   * Output: "56088"
+   *
+   * -> actual op:
+   *    123
+   *  x 456
+   *  ---------
+   *
+   *
+   *  -> (100 * 1 + 10 * 2 + 1 * 3) * (100 * 4 + 10 * 5 + 1 * 6)
+   *
+   *  ->
+   *
+   *
+   * IDEA: STRING OP
+   *
+   *
+   */
+  public String multiply(String num1, String num2) {
+
+      // edge
+      if (num1.equals("0") || num2.equals("0")){
+          return "0";
+      }
+
+      if (num1.equals("1") || num2.equals("1")){
+          if (num1.equals("1")){
+              return num2;
+          }
+          return num1;
+      }
+
+      if (num1.length() == 1 && num2.length() == 1){
+          // ???
+          return String.valueOf((num1.charAt(0) - '0') * (num2.charAt(0) - '0'));
+      }
+
+      // loop over `digits`
+      StringBuilder sb = new StringBuilder();
+      String longer = null;
+      String shorter = null;
+      if(num1.length() > num2.length()){
+          longer = num1;
+          shorter = num2;
+      }else{
+          longer = num2;
+          shorter = num1;
+      }
+
+
+//      // double loop ??
+//      for(int i = 0; i < longer.length(); i++){
+//          for(int j = 0; j < shorter.length(); j++){
+//              in
+//          }
+//      }
+
+
+      return null;
+    }
+
 
 
 }