Added exec time 931-943, 950, 951, 955, 956.

javadev · web-flow · commit f86388de837f · 2022-03-30T05:38:05.000+03:00
diff --git a/src.save/main/java/g0901_1000/s0931_minimum_falling_path_sum/Solution.java b/src.save/main/java/g0901_1000/s0931_minimum_falling_path_sum/Solution.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0931_minimum_falling_path_sum;
 
-// #Medium #Array #Dynamic_Programming #Matrix
+// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_13
+// #2022_03_30_Time_4_ms_(72.19%)_Space_48.3_MB_(12.49%)
 
 public class Solution {
     public int minFallingPathSum(int[][] matrix) {
diff --git a/src.save/main/java/g0901_1000/s0932_beautiful_array/Solution.java b/src.save/main/java/g0901_1000/s0932_beautiful_array/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0932_beautiful_array;
 
-// #Medium #Array #Math #Divide_and_Conquer
+// #Medium #Array #Math #Divide_and_Conquer #2022_03_30_Time_1_ms_(89.66%)_Space_43_MB_(38.97%)
 
 import java.util.HashMap;
 import java.util.Map;
diff --git a/src.save/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java b/src.save/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0933_number_of_recent_calls;
 
-// #Easy #Design #Queue #Data_Stream
+// #Easy #Design #Queue #Data_Stream #2022_03_30_Time_16_ms_(97.58%)_Space_50.8_MB_(80.12%)
 
 import java.util.LinkedList;
 import java.util.Queue;
@@ -21,3 +21,9 @@ public int ping(int t) {
         return q.size();
     }
 }
+
+/*
+ * Your RecentCounter object will be instantiated and called as such:
+ * RecentCounter obj = new RecentCounter();
+ * int param_1 = obj.ping(t);
+ */
diff --git a/src.save/main/java/g0901_1000/s0934_shortest_bridge/Solution.java b/src.save/main/java/g0901_1000/s0934_shortest_bridge/Solution.java
@@ -1,6 +1,8 @@
 package g0901_1000.s0934_shortest_bridge;
 
 // #Medium #Array #Depth_First_Search #Breadth_First_Search #Matrix
+// #Graph_Theory_I_Day_6_Matrix_Related_Problems
+// #2022_03_30_Time_6_ms_(97.87%)_Space_42.8_MB_(86.98%)
 
 import java.util.ArrayDeque;
 
diff --git a/src.save/main/java/g0901_1000/s0935_knight_dialer/Solution.java b/src.save/main/java/g0901_1000/s0935_knight_dialer/Solution.java
@@ -1,12 +1,11 @@
 package g0901_1000.s0935_knight_dialer;
 
-// #Medium #Dynamic_Programming
+// #Medium #Dynamic_Programming #2022_03_30_Time_4_ms_(99.08%)_Space_42.2_MB_(81.87%)
 
 import java.util.ArrayList;
 import java.util.List;
 
 public class Solution {
-
     private static final int[][] MAP = new int[10][];
     private static final List<int[]> MEMO = new ArrayList<>();
 
diff --git a/src.save/main/java/g0901_1000/s0936_stamping_the_sequence/Solution.java b/src.save/main/java/g0901_1000/s0936_stamping_the_sequence/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0936_stamping_the_sequence;
 
-// #Hard #String #Greedy #Stack #Queue #2022_02_17_Time_4_ms_(90.57%)_Space_45.7_MB_(30.19%)
+// #Hard #String #Greedy #Stack #Queue #2022_03_30_Time_6_ms_(78.43%)_Space_45.6_MB_(27.45%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src.save/main/java/g0901_1000/s0937_reorder_data_in_log_files/Solution.java b/src.save/main/java/g0901_1000/s0937_reorder_data_in_log_files/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0937_reorder_data_in_log_files;
 
-// #Easy #Array #String #Sorting #2022_02_18_Time_4_ms_(91.55%)_Space_45.5_MB_(49.57%)
+// #Easy #Array #String #Sorting #2022_03_30_Time_4_ms_(92.15%)_Space_46_MB_(66.46%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src.save/main/java/g0901_1000/s0938_range_sum_of_bst/Solution.java b/src.save/main/java/g0901_1000/s0938_range_sum_of_bst/Solution.java
@@ -1,7 +1,7 @@
 package g0901_1000.s0938_range_sum_of_bst;
 
 // #Easy #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
-// #2022_02_17_Time_0_ms_(100.00%)_Space_67.6_MB_(10.68%)
+// #2022_03_30_Time_0_ms_(100.00%)_Space_64.7_MB_(76.99%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src.save/main/java/g0901_1000/s0939_minimum_area_rectangle/Solution.java b/src.save/main/java/g0901_1000/s0939_minimum_area_rectangle/Solution.java
@@ -1,7 +1,7 @@
 package g0901_1000.s0939_minimum_area_rectangle;
 
 // #Medium #Array #Hash_Table #Math #Sorting #Geometry
-// #2022_02_17_Time_31_ms_(99.11%)_Space_42.4_MB_(71.12%)
+// #2022_03_30_Time_63_ms_(94.31%)_Space_54.6_MB_(73.31%)
 
 import java.util.Arrays;
 import java.util.HashMap;
diff --git a/src.save/main/java/g0901_1000/s0940_distinct_subsequences_ii/Solution.java b/src.save/main/java/g0901_1000/s0940_distinct_subsequences_ii/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0940_distinct_subsequences_ii;
 
-// #Hard #String #Dynamic_Programming #2022_02_17_Time_3_ms_(86.56%)_Space_40.3_MB_(27.86%)
+// #Hard #String #Dynamic_Programming #2022_03_30_Time_2_ms_(99.41%)_Space_40.3_MB_(98.22%)
 
 public class Solution {
     public int distinctSubseqII(String str) {
diff --git a/src.save/main/java/g0901_1000/s0941_valid_mountain_array/Solution.java b/src.save/main/java/g0901_1000/s0941_valid_mountain_array/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0941_valid_mountain_array;
 
-// #Easy #Array #2022_02_18_Time_2_ms_(73.30%)_Space_54.3_MB_(5.33%)
+// #Easy #Array #2022_03_30_Time_1_ms_(100.00%)_Space_43_MB_(93.41%)
 
 public class Solution {
     public boolean validMountainArray(int[] arr) {
diff --git a/src.save/main/java/g0901_1000/s0942_di_string_match/Solution.java b/src.save/main/java/g0901_1000/s0942_di_string_match/Solution.java
@@ -1,10 +1,9 @@
 package g0901_1000.s0942_di_string_match;
 
 // #Easy #Array #String #Math #Greedy #Two_Pointers
-// #2022_02_18_Time_2_ms_(98.58%)_Space_42.9_MB_(70.22%)
+// #2022_03_30_Time_4_ms_(33.74%)_Space_48.7_MB_(20.18%)
 
 public class Solution {
-
     public int[] diStringMatch(String s) {
         int[] arr = new int[s.length() + 1];
         int max = s.length();
diff --git a/src.save/main/java/g0901_1000/s0943_find_the_shortest_superstring/Solution.java b/src.save/main/java/g0901_1000/s0943_find_the_shortest_superstring/Solution.java
@@ -1,7 +1,7 @@
 package g0901_1000.s0943_find_the_shortest_superstring;
 
 // #Hard #Array #String #Dynamic_Programming #Bit_Manipulation #Bitmask
-// #2022_02_19_Time_33_ms_(84.73%)_Space_48_MB_(71.76%)
+// #2022_03_30_Time_16_ms_(100.00%)_Space_42.3_MB_(95.24%)
 
 import java.util.Arrays;
 
diff --git a/src.save/main/java/g0901_1000/s0950_reveal_cards_in_increasing_order/Solution.java b/src.save/main/java/g0901_1000/s0950_reveal_cards_in_increasing_order/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0950_reveal_cards_in_increasing_order;
 
-// #Medium #Array #Sorting #Simulation #Queue
+// #Medium #Array #Sorting #Simulation #Queue #2022_03_30_Time_1_ms_(100.00%)_Space_42.6_MB_(83.19%)
 
 import java.util.Arrays;
 
diff --git a/src.save/main/java/g0901_1000/s0951_flip_equivalent_binary_trees/Solution.java b/src.save/main/java/g0901_1000/s0951_flip_equivalent_binary_trees/Solution.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0951_flip_equivalent_binary_trees;
 
 // #Medium #Depth_First_Search #Tree #Binary_Tree
+// #2022_03_30_Time_0_ms_(100.00%)_Space_43_MB_(7.64%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src.save/main/java/g0901_1000/s0955_delete_columns_to_make_sorted_ii/Solution.java b/src.save/main/java/g0901_1000/s0955_delete_columns_to_make_sorted_ii/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0955_delete_columns_to_make_sorted_ii;
 
-// #Medium #Array #String #Greedy
+// #Medium #Array #String #Greedy #2022_03_30_Time_2_ms_(68.84%)_Space_42.4_MB_(47.83%)
 
 public class Solution {
     public int minDeletionSize(String[] strs) {
diff --git a/src.save/main/java/g0901_1000/s0956_tallest_billboard/Solution.java b/src.save/main/java/g0901_1000/s0956_tallest_billboard/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0956_tallest_billboard;
 
-// #Hard #Array #Dynamic_Programming
+// #Hard #Array #Dynamic_Programming #2022_03_30_Time_18_ms_(92.68%)_Space_54.4_MB_(57.72%)
 
 import java.util.Arrays;
 
