Updated tags

javadev · web-flow · commit 050abddf2216 · 2025-03-05T22:22:40.000+02:00
diff --git a/README.md b/README.md
@@ -1525,10 +1525,10 @@ implementation 'com.github.javadev:leetcode-in-java:1.41'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 100.00
 | 0003 |[Longest Substring Without Repeating Characters](src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59
 | 0030 |[Substring with Concatenation of All Words](src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.java)| Hard | String, Hash_Table, Sliding_Window | 11 | 97.43
 | 0076 |[Minimum Window Substring](src/main/java/g0001_0100/s0076_minimum_window_substring/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83
-| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 100.00
 
 #### Top Interview 150 Matrix
 
diff --git a/src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java b/src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0012_integer_to_roman;
 
 // #Medium #String #Hash_Table #Math #Top_Interview_150_Array/String
-// #2025_03_04_Time_2_(100.00%)_Space_44.30_(83.82%)
+// #2025_03_04_Time_2_ms_(100.00%)_Space_44.30_MB_(83.82%)
 
 public class Solution {
     public String intToRoman(int num) {
diff --git a/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java b/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0013_roman_to_integer;
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math
-// #Top_Interview_150_Array/String #2025_03_04_Time_2_(100.00%)_Space_44.54_(91.65%)
+// #Top_Interview_150_Array/String #2025_03_04_Time_2_ms_(100.00%)_Space_44.54_MB_(91.65%)
 
 public class Solution {
     public int romanToInt(String s) {
diff --git a/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java b/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java
@@ -1,7 +1,8 @@
 package g0001_0100.s0014_longest_common_prefix;
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String
-// #Udemy_Strings #Top_Interview_150_Array/String #2025_03_04_Time_0_(100.00%)_Space_41.35_(87.42%)
+// #Udemy_Strings #Top_Interview_150_Array/String
+// #2025_03_04_Time_0_ms_(100.00%)_Space_41.35_MB_(87.42%)
 
 public class Solution {
     public String longestCommonPrefix(String[] strs) {
diff --git a/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java b/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0026_remove_duplicates_from_sorted_array;
 
 // #Easy #Top_Interview_Questions #Array #Two_Pointers #Udemy_Two_Pointers
-// #Top_Interview_150_Array/String #2025_03_04_Time_0_(100.00%)_Space_44.59_(95.49%)
+// #Top_Interview_150_Array/String #2025_03_04_Time_0_ms_(100.00%)_Space_44.59_MB_(95.49%)
 
 public class Solution {
     public int removeDuplicates(int[] nums) {
diff --git a/src/main/java/g0001_0100/s0027_remove_element/Solution.java b/src/main/java/g0001_0100/s0027_remove_element/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0027_remove_element;
 
 // #Easy #Array #Two_Pointers #Top_Interview_150_Array/String
-// #2025_03_04_Time_0_(100.00%)_Space_42.15_(29.50%)
+// #2025_03_04_Time_0_ms_(100.00%)_Space_42.15_MB_(29.50%)
 
 public class Solution {
     public int removeElement(int[] nums, int val) {
diff --git a/src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.java b/src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.java
@@ -2,7 +2,7 @@
 
 // #Easy #Top_Interview_Questions #String #Two_Pointers #String_Matching
 // #Programming_Skills_II_Day_1 #Top_Interview_150_Array/String
-// #2025_03_04_Time_0_(100.00%)_Space_41.19_(97.77%)
+// #2025_03_04_Time_0_ms_(100.00%)_Space_41.19_MB_(97.77%)
 
 public class Solution {
     public int strStr(String haystack, String needle) {
diff --git a/src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.java b/src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0030_substring_with_concatenation_of_all_words;
 
 // #Hard #String #Hash_Table #Sliding_Window #Top_Interview_150_Sliding_Window
-// #2025_03_04_Time_11_(97.43%)_Space_45.96_(24.38%)
+// #2025_03_04_Time_11_ms_(97.43%)_Space_45.96_MB_(24.38%)
 
 import java.util.ArrayList;
 import java.util.HashMap;
diff --git a/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java b/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0036_valid_sudoku;
 
 // #Medium #Top_Interview_Questions #Array #Hash_Table #Matrix #Data_Structure_I_Day_5_Array
-// #Top_Interview_150_Matrix #2025_03_04_Time_1_(100.00%)_Space_44.50_(57.83%)
+// #Top_Interview_150_Matrix #2025_03_04_Time_1_ms_(100.00%)_Space_44.50_MB_(57.83%)
 
 public class Solution {
     private int j1;
diff --git a/src/main/java/g0001_0100/s0050_powx_n/Solution.java b/src/main/java/g0001_0100/s0050_powx_n/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0050_powx_n;
 
 // #Medium #Top_Interview_Questions #Math #Recursion #Udemy_Integers #Top_Interview_150_Math
-// #2025_03_04_Time_0_(100.00%)_Space_41.72_(93.18%)
+// #2025_03_04_Time_0_ms_(100.00%)_Space_41.72_MB_(93.18%)
 
 public class Solution {
     public double myPow(double x, int n) {
diff --git a/src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java b/src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0052_n_queens_ii;
 
 // #Hard #Backtracking #Top_Interview_150_Backtracking
-// #2025_03_04_Time_0_(100.00%)_Space_41.18_(24.45%)
+// #2025_03_04_Time_0_ms_(100.00%)_Space_41.18_MB_(24.45%)
 
 public class Solution {
     public int totalNQueens(int n) {
diff --git a/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java b/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Simulation
 // #Programming_Skills_II_Day_8 #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
-// #Top_Interview_150_Matrix #2025_03_04_Time_0_(100.00%)_Space_41.08_(99.19%)
+// #Top_Interview_150_Matrix #2025_03_04_Time_0_ms_(100.00%)_Space_41.08_MB_(99.19%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g0001_0100/s0057_insert_interval/Solution.java b/src/main/java/g0001_0100/s0057_insert_interval/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0057_insert_interval;
 
 // #Medium #Array #Level_2_Day_17_Interval #Top_Interview_150_Intervals
-// #2025_03_04_Time_0_(100.00%)_Space_44.76_(89.09%)
+// #2025_03_04_Time_0_ms_(100.00%)_Space_44.76_MB_(89.09%)
 
 import java.util.Arrays;
 
diff --git a/src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java b/src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0058_length_of_last_word;
 
 // #Easy #String #Programming_Skills_II_Day_6 #Udemy_Arrays #Top_Interview_150_Array/String
-// #2025_03_04_Time_0_(100.00%)_Space_41.72_(64.92%)
+// #2025_03_04_Time_0_ms_(100.00%)_Space_41.72_MB_(64.92%)
 
 public class Solution {
     public int lengthOfLastWord(String s) {
diff --git a/src/main/java/g0001_0100/s0061_rotate_list/Solution.java b/src/main/java/g0001_0100/s0061_rotate_list/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0061_rotate_list;
 
 // #Medium #Two_Pointers #Linked_List #Programming_Skills_II_Day_16 #Udemy_Linked_List
-// #Top_Interview_150_Linked_List #2025_03_04_Time_0_(100.00%)_Space_42.42_(78.37%)
+// #Top_Interview_150_Linked_List #2025_03_04_Time_0_ms_(100.00%)_Space_42.42_MB_(78.37%)
 
 import com_github_leetcode.ListNode;
 
diff --git a/src/main/java/g0001_0100/s0063_unique_paths_ii/Solution.java b/src/main/java/g0001_0100/s0063_unique_paths_ii/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0063_unique_paths_ii;
 
 // #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_15
-// #Top_Interview_150_Multidimensional_DP #2025_03_04_Time_0_(100.00%)_Space_41.62_(79.66%)
+// #Top_Interview_150_Multidimensional_DP #2025_03_04_Time_0_ms_(100.00%)_Space_41.62_MB_(79.66%)
 
 public class Solution {
     public int uniquePathsWithObstacles(int[][] obstacleGrid) {
diff --git a/src/main/java/g0001_0100/s0066_plus_one/Solution.java b/src/main/java/g0001_0100/s0066_plus_one/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0066_plus_one;
 
 // #Easy #Top_Interview_Questions #Array #Math #Programming_Skills_II_Day_3 #Udemy_Arrays
-// #Top_Interview_150_Math #2025_03_05_Time_0_(100.00%)_Space_41.78_(81.75%)
+// #Top_Interview_150_Math #2025_03_05_Time_0_ms_(100.00%)_Space_41.78_MB_(81.75%)
 
 public class Solution {
     public int[] plusOne(int[] digits) {
diff --git a/src/main/java/g0001_0100/s0067_add_binary/Solution.java b/src/main/java/g0001_0100/s0067_add_binary/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0067_add_binary;
 
 // #Easy #String #Math #Bit_Manipulation #Simulation #Programming_Skills_II_Day_5
-// #Top_Interview_150_Bit_Manipulation #2025_03_05_Time_1_(99.82%)_Space_42.31_(52.66%)
+// #Top_Interview_150_Bit_Manipulation #2025_03_05_Time_1_ms_(99.82%)_Space_42.31_MB_(52.66%)
 
 public class Solution {
     public String addBinary(String a, String b) {
diff --git a/src/main/java/g0001_0100/s0068_text_justification/Solution.java b/src/main/java/g0001_0100/s0068_text_justification/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0068_text_justification;
 
 // #Hard #Array #String #Simulation #Top_Interview_150_Array/String
-// #2025_03_05_Time_0_(100.00%)_Space_42.06_(29.81%)
+// #2025_03_05_Time_0_ms_(100.00%)_Space_42.06_MB_(29.81%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g0001_0100/s0069_sqrtx/Solution.java b/src/main/java/g0001_0100/s0069_sqrtx/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0069_sqrtx;
 
 // #Easy #Top_Interview_Questions #Math #Binary_Search #Binary_Search_I_Day_4
-// #Top_Interview_150_Math #2025_03_05_Time_1_(86.67%)_Space_41.11_(29.05%)
+// #Top_Interview_150_Math #2025_03_05_Time_1_ms_(86.67%)_Space_41.11_MB_(29.05%)
 
 public class Solution {
     public int mySqrt(int x) {
diff --git a/src/main/java/g0001_0100/s0071_simplify_path/Solution.java b/src/main/java/g0001_0100/s0071_simplify_path/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0071_simplify_path;
 
-// #Medium #String #Stack #Top_Interview_150_Stack #2025_03_05_Time_2_(99.86%)_Space_43.12_(91.80%)
+// #Medium #String #Stack #Top_Interview_150_Stack
+// #2025_03_05_Time_2_ms_(99.86%)_Space_43.12_MB_(91.80%)
 
 import java.util.ArrayDeque;
 import java.util.Deque;
diff --git a/src/main/java/g0001_0100/s0077_combinations/Solution.java b/src/main/java/g0001_0100/s0077_combinations/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0077_combinations;
 
 // #Medium #Backtracking #Algorithm_I_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
-// #2025_03_05_Time_15_(92.38%)_Space_92.30_(94.55%)
+// #2025_03_05_Time_15_ms_(92.38%)_Space_92.30_MB_(94.55%)
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;
diff --git a/src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.java b/src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0080_remove_duplicates_from_sorted_array_ii;
 
 // #Medium #Array #Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String
-// #2025_03_05_Time_0_(100.00%)_Space_46.59_(39.01%)
+// #2025_03_05_Time_0_ms_(100.00%)_Space_46.59_MB_(39.01%)
 
 public class Solution {
     public int removeDuplicates(int[] nums) {
diff --git a/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.java b/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Two_Pointers #Linked_List #Data_Structure_II_Day_11_Linked_List
 // #Algorithm_II_Day_3_Two_Pointers #Top_Interview_150_Linked_List
-// #2025_03_05_Time_0_(100.00%)_Space_43.31_(44.18%)
+// #2025_03_05_Time_0_ms_(100.00%)_Space_43.31_MB_(44.18%)
 
 import com_github_leetcode.ListNode;
 
diff --git a/src/main/java/g0001_0100/s0086_partition_list/Solution.java b/src/main/java/g0001_0100/s0086_partition_list/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0086_partition_list;
 
 // #Medium #Two_Pointers #Linked_List #Top_Interview_150_Linked_List
-// #2025_03_05_Time_0_(100.00%)_Space_41.88_(91.77%)
+// #2025_03_05_Time_0_ms_(100.00%)_Space_41.88_MB_(91.77%)
 
 import com_github_leetcode.ListNode;
 
diff --git a/src/main/java/g0001_0100/s0088_merge_sorted_array/Solution.java b/src/main/java/g0001_0100/s0088_merge_sorted_array/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0088_merge_sorted_array;
 
 // #Easy #Top_Interview_Questions #Array #Sorting #Two_Pointers #Data_Structure_I_Day_2_Array
-// #Top_Interview_150_Array/String #2025_03_05_Time_0_(100.00%)_Space_42.40_(26.50%)
+// #Top_Interview_150_Array/String #2025_03_05_Time_0_ms_(100.00%)_Space_42.40_MB_(26.50%)
 
 public class Solution {
     public void merge(int[] nums1, int m, int[] nums2, int n) {
diff --git a/src/main/java/g0001_0100/s0092_reverse_linked_list_ii/Solution.java b/src/main/java/g0001_0100/s0092_reverse_linked_list_ii/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0092_reverse_linked_list_ii;
 
 // #Medium #Linked_List #Top_Interview_150_Linked_List
-// #2025_03_05_Time_0_(100.00%)_Space_41.36_(51.54%)
+// #2025_03_05_Time_0_ms_(100.00%)_Space_41.36_MB_(51.54%)
 
 import com_github_leetcode.ListNode;
 
diff --git a/src/main/java/g0001_0100/s0097_interleaving_string/Solution.java b/src/main/java/g0001_0100/s0097_interleaving_string/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0097_interleaving_string;
 
 // #Medium #String #Dynamic_Programming #Top_Interview_150_Multidimensional_DP
-// #2025_03_05_Time_0_(100.00%)_Space_42.24_(22.76%)
+// #2025_03_05_Time_0_ms_(100.00%)_Space_42.24_MB_(22.76%)
 
 public class Solution {
     public boolean isInterleave(String s1, String s2, String s3) {
diff --git a/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java b/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_Interview_Questions #Breadth_First_Search #Tree #Binary_Tree
 // #Data_Structure_II_Day_15_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_BFS
-// #2025_03_05_Time_0_(100.00%)_Space_42.68_(7.11%)
+// #2025_03_05_Time_0_ms_(100.00%)_Space_42.68_MB_(7.11%)
 
 import com_github_leetcode.TreeNode;
 import java.util.ArrayList;
diff --git a/src/main/java/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.java b/src/main/java/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.java
@@ -1,7 +1,7 @@
 package g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal;
 
 // #Medium #Array #Hash_Table #Tree #Binary_Tree #Divide_and_Conquer
-// #Top_Interview_150_Binary_Tree_General #2025_03_05_Time_0_(100.00%)_Space_45.01_(8.73%)
+// #Top_Interview_150_Binary_Tree_General #2025_03_05_Time_0_ms_(100.00%)_Space_45.01_MB_(8.73%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java b/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java
@@ -2,7 +2,7 @@
 
 // #Easy #Top_Interview_Questions #Array #Tree #Binary_Tree #Binary_Search_Tree #Divide_and_Conquer
 // #Data_Structure_II_Day_15_Tree #Level_2_Day_9_Binary_Search_Tree #Udemy_Tree_Stack_Queue
-// #Top_Interview_150_Divide_and_Conquer #2025_03_05_Time_0_(100.00%)_Space_43.75_(11.21%)
+// #Top_Interview_150_Divide_and_Conquer #2025_03_05_Time_0_ms_(100.00%)_Space_43.75_MB_(11.21%)
 
 import com_github_leetcode.TreeNode;
 
